/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:14:51,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:14:51,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:14:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:14:51,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:14:51,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:14:51,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:14:51,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:14:51,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:14:51,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:14:51,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:14:51,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:14:51,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:14:51,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:14:51,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:14:51,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:14:51,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:14:51,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:14:51,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:14:51,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:14:51,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:14:51,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:14:51,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:14:51,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:14:51,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:14:51,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:14:51,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:14:51,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:14:51,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:14:51,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:14:51,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:14:51,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:14:51,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:14:51,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:14:51,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:14:51,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:14:51,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:14:51,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:14:51,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:14:51,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:14:51,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:14:51,491 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:14:51,505 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:14:51,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:14:51,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:14:51,506 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:14:51,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:14:51,507 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:14:51,507 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:14:51,507 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:14:51,507 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:14:51,507 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:14:51,508 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:14:51,508 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:14:51,508 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:14:51,508 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:14:51,508 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:51,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:14:51,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:14:51,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:14:51,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:14:51,509 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:14:51,509 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:14:51,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:14:51,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:14:51,510 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:14:51,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:14:51,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:14:51,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:14:51,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:14:51,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:14:51,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:14:51,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:14:51,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:14:51,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:14:51,694 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:14:51,695 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:14:51,756 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_4weMSn/tmp/eeaa5ab6a65f4c2b8eefab7891bb374b/FLAGd28b27501 [2020-07-01 11:14:52,088 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:14:52,089 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:14:52,095 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_4weMSn/tmp/eeaa5ab6a65f4c2b8eefab7891bb374b/FLAGd28b27501 [2020-07-01 11:14:52,491 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_4weMSn/tmp/eeaa5ab6a65f4c2b8eefab7891bb374b [2020-07-01 11:14:52,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:14:52,504 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:14:52,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:14:52,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:14:52,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:14:52,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d19ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52, skipping insertion in model container [2020-07-01 11:14:52,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:14:52,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:14:52,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:14:52,786 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:14:52,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:14:52,830 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:14:52,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52 WrapperNode [2020-07-01 11:14:52,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:14:52,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:14:52,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:14:52,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:14:52,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:14:52,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:14:52,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:14:52,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:14:52,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... [2020-07-01 11:14:52,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:14:52,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:14:52,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:14:52,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:14:52,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:14:52,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:14:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:14:52,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:14:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:14:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 11:14:52,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 11:14:53,258 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:14:53,259 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-01 11:14:53,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:14:53 BoogieIcfgContainer [2020-07-01 11:14:53,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:14:53,263 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:14:53,263 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:14:53,266 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:14:53,266 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:14:53" (1/1) ... [2020-07-01 11:14:53,281 INFO L313 BlockEncoder]: Initial Icfg 46 locations, 55 edges [2020-07-01 11:14:53,283 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:14:53,284 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:14:53,284 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:14:53,285 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:14:53,287 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:14:53,288 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:14:53,288 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:14:53,315 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:14:53,344 INFO L200 BlockEncoder]: SBE split 20 edges [2020-07-01 11:14:53,348 INFO L70 emoveInfeasibleEdges]: Removed 5 edges and 0 locations because of local infeasibility [2020-07-01 11:14:53,350 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:14:53,376 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 11:14:53,379 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-07-01 11:14:53,381 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:14:53,381 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:14:53,381 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:14:53,382 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:14:53,382 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 59 edges [2020-07-01 11:14:53,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:14:53 BasicIcfg [2020-07-01 11:14:53,383 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:14:53,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:14:53,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:14:53,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:14:53,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:14:52" (1/4) ... [2020-07-01 11:14:53,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28526233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:14:53, skipping insertion in model container [2020-07-01 11:14:53,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (2/4) ... [2020-07-01 11:14:53,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28526233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:14:53, skipping insertion in model container [2020-07-01 11:14:53,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:14:53" (3/4) ... [2020-07-01 11:14:53,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28526233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:14:53, skipping insertion in model container [2020-07-01 11:14:53,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:14:53" (4/4) ... [2020-07-01 11:14:53,393 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:14:53,403 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:14:53,411 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 11:14:53,425 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 11:14:53,448 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:14:53,449 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:14:53,449 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:14:53,449 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:14:53,449 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:14:53,449 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:14:53,450 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:14:53,450 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:14:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-01 11:14:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:14:53,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:53,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:14:53,472 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash 167156927, now seen corresponding path program 1 times [2020-07-01 11:14:53,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:53,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084614337] [2020-07-01 11:14:53,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:53,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084614337] [2020-07-01 11:14:53,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:53,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:14:53,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542620596] [2020-07-01 11:14:53,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:14:53,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:14:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:53,661 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 11:14:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:53,775 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2020-07-01 11:14:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:14:53,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 11:14:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:53,788 INFO L225 Difference]: With dead ends: 68 [2020-07-01 11:14:53,788 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 11:14:53,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 11:14:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 11:14:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 11:14:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-07-01 11:14:53,830 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 5 [2020-07-01 11:14:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:53,830 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-07-01 11:14:53,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:14:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-07-01 11:14:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:14:53,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:53,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:14:53,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:14:53,833 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 167186718, now seen corresponding path program 1 times [2020-07-01 11:14:53,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:53,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135544892] [2020-07-01 11:14:53,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:53,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135544892] [2020-07-01 11:14:53,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:53,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:14:53,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534389270] [2020-07-01 11:14:53,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:14:53,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:14:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:53,873 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 3 states. [2020-07-01 11:14:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:53,981 INFO L93 Difference]: Finished difference Result 35 states and 58 transitions. [2020-07-01 11:14:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:14:53,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 11:14:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:53,983 INFO L225 Difference]: With dead ends: 35 [2020-07-01 11:14:53,983 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 11:14:53,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 11:14:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 11:14:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 11:14:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-07-01 11:14:53,990 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 5 [2020-07-01 11:14:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:53,990 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-07-01 11:14:53,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:14:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-07-01 11:14:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:14:53,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:53,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:14:53,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:14:53,991 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 167186720, now seen corresponding path program 1 times [2020-07-01 11:14:53,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:53,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491497203] [2020-07-01 11:14:53,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:54,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491497203] [2020-07-01 11:14:54,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:54,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:54,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199765181] [2020-07-01 11:14:54,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:54,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:54,033 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2020-07-01 11:14:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:54,172 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-07-01 11:14:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:54,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 11:14:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:54,173 INFO L225 Difference]: With dead ends: 67 [2020-07-01 11:14:54,173 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 11:14:54,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 11:14:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-01 11:14:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 11:14:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2020-07-01 11:14:54,181 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 5 [2020-07-01 11:14:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:54,181 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2020-07-01 11:14:54,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2020-07-01 11:14:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:14:54,182 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:54,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:14:54,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:14:54,182 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 167186721, now seen corresponding path program 1 times [2020-07-01 11:14:54,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:54,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796782755] [2020-07-01 11:14:54,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:54,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796782755] [2020-07-01 11:14:54,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:54,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:54,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620547403] [2020-07-01 11:14:54,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:54,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:54,224 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 4 states. [2020-07-01 11:14:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:54,333 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-07-01 11:14:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:54,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 11:14:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:54,335 INFO L225 Difference]: With dead ends: 42 [2020-07-01 11:14:54,335 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 11:14:54,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 11:14:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-01 11:14:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 11:14:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2020-07-01 11:14:54,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 5 [2020-07-01 11:14:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:54,341 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2020-07-01 11:14:54,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2020-07-01 11:14:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 11:14:54,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:54,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 11:14:54,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:14:54,343 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 888978758, now seen corresponding path program 1 times [2020-07-01 11:14:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:54,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237389015] [2020-07-01 11:14:54,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:54,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237389015] [2020-07-01 11:14:54,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:54,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:54,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769259102] [2020-07-01 11:14:54,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:14:54,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:14:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:54,365 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 3 states. [2020-07-01 11:14:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:54,446 INFO L93 Difference]: Finished difference Result 84 states and 126 transitions. [2020-07-01 11:14:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:14:54,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 11:14:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:54,449 INFO L225 Difference]: With dead ends: 84 [2020-07-01 11:14:54,449 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 11:14:54,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 11:14:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2020-07-01 11:14:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 11:14:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2020-07-01 11:14:54,458 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 6 [2020-07-01 11:14:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:54,458 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-07-01 11:14:54,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:14:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2020-07-01 11:14:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 11:14:54,459 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:54,459 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:54,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:14:54,459 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1528081217, now seen corresponding path program 1 times [2020-07-01 11:14:54,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:54,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850642007] [2020-07-01 11:14:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:54,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850642007] [2020-07-01 11:14:54,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23113016] [2020-07-01 11:14:54,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:54,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:14:54,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-07-01 11:14:54,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253797720] [2020-07-01 11:14:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:14:54,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:54,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:14:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:54,610 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand 5 states. [2020-07-01 11:14:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:54,711 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2020-07-01 11:14:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:14:54,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 11:14:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:54,712 INFO L225 Difference]: With dead ends: 50 [2020-07-01 11:14:54,713 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 11:14:54,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 11:14:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-01 11:14:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 11:14:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2020-07-01 11:14:54,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 10 [2020-07-01 11:14:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:54,720 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-07-01 11:14:54,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:14:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2020-07-01 11:14:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 11:14:54,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:54,721 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:54,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-01 11:14:54,922 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1528081218, now seen corresponding path program 1 times [2020-07-01 11:14:54,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:54,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872877130] [2020-07-01 11:14:54,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:14:54,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872877130] [2020-07-01 11:14:54,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:54,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:54,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375499292] [2020-07-01 11:14:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:54,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:54,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:54,978 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 4 states. [2020-07-01 11:14:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:55,042 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-01 11:14:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:55,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 11:14:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:55,043 INFO L225 Difference]: With dead ends: 41 [2020-07-01 11:14:55,043 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 11:14:55,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 11:14:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-07-01 11:14:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 11:14:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-01 11:14:55,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 10 [2020-07-01 11:14:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:55,049 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-01 11:14:55,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-01 11:14:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 11:14:55,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:55,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:55,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:14:55,050 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash 758334637, now seen corresponding path program 1 times [2020-07-01 11:14:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:55,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649904291] [2020-07-01 11:14:55,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:55,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649904291] [2020-07-01 11:14:55,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134001011] [2020-07-01 11:14:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:55,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:55,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:55,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:14:55,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-01 11:14:55,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215608069] [2020-07-01 11:14:55,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:14:55,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:14:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:14:55,129 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 5 states. [2020-07-01 11:14:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:55,210 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2020-07-01 11:14:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:55,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-01 11:14:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:55,211 INFO L225 Difference]: With dead ends: 77 [2020-07-01 11:14:55,211 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 11:14:55,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:14:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 11:14:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2020-07-01 11:14:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 11:14:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2020-07-01 11:14:55,218 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 13 [2020-07-01 11:14:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:55,218 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-07-01 11:14:55,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:14:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2020-07-01 11:14:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 11:14:55,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:55,219 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:55,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:55,420 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1491676622, now seen corresponding path program 2 times [2020-07-01 11:14:55,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:55,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373272148] [2020-07-01 11:14:55,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:55,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373272148] [2020-07-01 11:14:55,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904097027] [2020-07-01 11:14:55,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:55,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 11:14:55,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:14:55,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:55,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:55,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:14:55,539 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:14:55,547 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:14:55,548 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:14:55,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:14:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 11:14:55,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:14:55,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-07-01 11:14:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957727754] [2020-07-01 11:14:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:55,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:14:55,575 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 4 states. [2020-07-01 11:14:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:55,653 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2020-07-01 11:14:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:55,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-01 11:14:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:55,654 INFO L225 Difference]: With dead ends: 49 [2020-07-01 11:14:55,654 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 11:14:55,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:14:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 11:14:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-01 11:14:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 11:14:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2020-07-01 11:14:55,660 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 18 [2020-07-01 11:14:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:55,661 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2020-07-01 11:14:55,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2020-07-01 11:14:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 11:14:55,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:55,662 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:55,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:55,863 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1491676623, now seen corresponding path program 1 times [2020-07-01 11:14:55,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:55,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553413818] [2020-07-01 11:14:55,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:55,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553413818] [2020-07-01 11:14:55,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650773057] [2020-07-01 11:14:55,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:55,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:55,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:55,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:14:55,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-01 11:14:55,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453898603] [2020-07-01 11:14:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:14:55,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:14:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:14:55,965 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 6 states. [2020-07-01 11:14:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:56,074 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2020-07-01 11:14:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:14:56,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-01 11:14:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:56,075 INFO L225 Difference]: With dead ends: 116 [2020-07-01 11:14:56,076 INFO L226 Difference]: Without dead ends: 72 [2020-07-01 11:14:56,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:14:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-01 11:14:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2020-07-01 11:14:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 11:14:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-07-01 11:14:56,083 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 18 [2020-07-01 11:14:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:56,084 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-07-01 11:14:56,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:14:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-01 11:14:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 11:14:56,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:56,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:56,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:56,286 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 130863438, now seen corresponding path program 2 times [2020-07-01 11:14:56,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:56,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322347272] [2020-07-01 11:14:56,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:56,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322347272] [2020-07-01 11:14:56,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251318296] [2020-07-01 11:14:56,339 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:56,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 11:14:56,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:14:56,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:56,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-01 11:14:56,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:14:56,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2020-07-01 11:14:56,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938084334] [2020-07-01 11:14:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:56,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:56,387 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 4 states. [2020-07-01 11:14:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:56,425 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2020-07-01 11:14:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:56,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-01 11:14:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:56,426 INFO L225 Difference]: With dead ends: 61 [2020-07-01 11:14:56,426 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 11:14:56,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 11:14:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-01 11:14:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 11:14:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2020-07-01 11:14:56,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 23 [2020-07-01 11:14:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:56,434 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-07-01 11:14:56,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2020-07-01 11:14:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-01 11:14:56,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:56,435 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:56,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 11:14:56,636 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash -238202659, now seen corresponding path program 1 times [2020-07-01 11:14:56,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:56,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436172303] [2020-07-01 11:14:56,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:56,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436172303] [2020-07-01 11:14:56,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077263782] [2020-07-01 11:14:56,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:56,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:56,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:56,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:14:56,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-01 11:14:56,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651114840] [2020-07-01 11:14:56,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:14:56,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:14:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:14:56,737 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 7 states. [2020-07-01 11:14:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:56,839 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2020-07-01 11:14:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:14:56,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-01 11:14:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:56,841 INFO L225 Difference]: With dead ends: 144 [2020-07-01 11:14:56,841 INFO L226 Difference]: Without dead ends: 86 [2020-07-01 11:14:56,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:14:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-01 11:14:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2020-07-01 11:14:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-01 11:14:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2020-07-01 11:14:56,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 24 [2020-07-01 11:14:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:56,849 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2020-07-01 11:14:56,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:14:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2020-07-01 11:14:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-01 11:14:56,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:56,850 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:57,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:57,051 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2141054692, now seen corresponding path program 2 times [2020-07-01 11:14:57,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:57,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3600957] [2020-07-01 11:14:57,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:57,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3600957] [2020-07-01 11:14:57,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668848219] [2020-07-01 11:14:57,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:57,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 11:14:57,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:14:57,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:57,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-01 11:14:57,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:14:57,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2020-07-01 11:14:57,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402297141] [2020-07-01 11:14:57,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:14:57,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:14:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-01 11:14:57,224 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 5 states. [2020-07-01 11:14:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:57,284 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2020-07-01 11:14:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:14:57,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-01 11:14:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:57,285 INFO L225 Difference]: With dead ends: 75 [2020-07-01 11:14:57,285 INFO L226 Difference]: Without dead ends: 74 [2020-07-01 11:14:57,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-01 11:14:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-01 11:14:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-01 11:14:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-01 11:14:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2020-07-01 11:14:57,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 29 [2020-07-01 11:14:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:57,292 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2020-07-01 11:14:57,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:14:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2020-07-01 11:14:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-01 11:14:57,294 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:57,294 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:57,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:57,495 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2141054691, now seen corresponding path program 1 times [2020-07-01 11:14:57,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:57,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542149837] [2020-07-01 11:14:57,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-01 11:14:57,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542149837] [2020-07-01 11:14:57,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:57,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:57,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384521361] [2020-07-01 11:14:57,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:57,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:57,558 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 4 states. [2020-07-01 11:14:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:57,605 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2020-07-01 11:14:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:57,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-01 11:14:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:57,606 INFO L225 Difference]: With dead ends: 74 [2020-07-01 11:14:57,606 INFO L226 Difference]: Without dead ends: 73 [2020-07-01 11:14:57,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-01 11:14:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-07-01 11:14:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-01 11:14:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2020-07-01 11:14:57,613 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 29 [2020-07-01 11:14:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:57,613 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2020-07-01 11:14:57,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2020-07-01 11:14:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-01 11:14:57,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:57,614 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:57,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 11:14:57,615 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:57,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1944813545, now seen corresponding path program 1 times [2020-07-01 11:14:57,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:57,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100250579] [2020-07-01 11:14:57,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-01 11:14:57,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100250579] [2020-07-01 11:14:57,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:57,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:14:57,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649224366] [2020-07-01 11:14:57,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:57,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:57,655 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 4 states. [2020-07-01 11:14:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:57,705 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2020-07-01 11:14:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:57,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-01 11:14:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:57,706 INFO L225 Difference]: With dead ends: 87 [2020-07-01 11:14:57,706 INFO L226 Difference]: Without dead ends: 79 [2020-07-01 11:14:57,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:14:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-01 11:14:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2020-07-01 11:14:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-01 11:14:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2020-07-01 11:14:57,713 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 30 [2020-07-01 11:14:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:57,714 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2020-07-01 11:14:57,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2020-07-01 11:14:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-01 11:14:57,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:57,715 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:57,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 11:14:57,715 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash -191218128, now seen corresponding path program 1 times [2020-07-01 11:14:57,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:57,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071177190] [2020-07-01 11:14:57,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 11:14:57,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071177190] [2020-07-01 11:14:57,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718900473] [2020-07-01 11:14:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:57,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:57,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 11:14:57,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:14:57,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-01 11:14:57,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134085141] [2020-07-01 11:14:57,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:14:57,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:14:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:57,836 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 8 states. [2020-07-01 11:14:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:57,960 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2020-07-01 11:14:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:14:57,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-01 11:14:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:57,961 INFO L225 Difference]: With dead ends: 172 [2020-07-01 11:14:57,961 INFO L226 Difference]: Without dead ends: 100 [2020-07-01 11:14:57,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:14:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-01 11:14:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2020-07-01 11:14:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-01 11:14:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2020-07-01 11:14:57,968 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 36 [2020-07-01 11:14:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:57,969 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2020-07-01 11:14:57,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:14:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2020-07-01 11:14:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-01 11:14:57,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:14:57,970 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:14:58,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 11:14:58,171 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:14:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781231, now seen corresponding path program 2 times [2020-07-01 11:14:58,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:58,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977844722] [2020-07-01 11:14:58,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 11:14:58,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977844722] [2020-07-01 11:14:58,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251225049] [2020-07-01 11:14:58,244 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:14:58,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 11:14:58,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:14:58,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:58,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:58,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:14:58,287 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:14:58,292 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:14:58,293 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:14:58,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:14:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-07-01 11:14:58,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:14:58,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2020-07-01 11:14:58,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113309264] [2020-07-01 11:14:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:14:58,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:14:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:14:58,332 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2020-07-01 11:14:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:58,379 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2020-07-01 11:14:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:14:58,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-01 11:14:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:14:58,380 INFO L225 Difference]: With dead ends: 88 [2020-07-01 11:14:58,380 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:14:58,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:14:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:14:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:14:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:14:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:14:58,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-01 11:14:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:14:58,381 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:14:58,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:14:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:14:58,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:14:58,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 11:14:58,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:14:58,874 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-01 11:14:58,874 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,874 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,874 INFO L268 CegarLoopResult]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,875 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 25) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|))) (.cse1 (<= 2 ULTIMATE.start_main_~i~0)) (.cse2 (= 0 |ULTIMATE.start_main_~#a~0.offset|)) (.cse3 (<= 1 |#StackHeapBarrier|)) (.cse4 (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 400000))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_main_~x~0) .cse4) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~y~0) .cse2 (<= 0 ULTIMATE.start_main_~x~0) .cse3 .cse4))) [2020-07-01 11:14:58,875 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 11:14:58,875 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 11:14:58,875 INFO L264 CegarLoopResult]: At program point L9-2(lines 9 17) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|))) (.cse1 (= 0 |ULTIMATE.start_main_~#a~0.offset|)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 400000))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~i~0) .cse3) (and .cse0 (<= 2 ULTIMATE.start_main_~i~0) .cse1 .cse2 .cse3))) [2020-07-01 11:14:58,876 INFO L264 CegarLoopResult]: At program point L9-3(lines 6 18) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|))) (.cse1 (= 0 |ULTIMATE.start_main_~#a~0.offset|)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 400000))) (or (and .cse0 (<= 1 ULTIMATE.start_main_~swapped~0) .cse1 .cse2 .cse3) (and .cse0 (<= 2 ULTIMATE.start_main_~i~0) .cse1 .cse2 .cse3))) [2020-07-01 11:14:58,876 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 11:14:58,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:14:58,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,876 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|)) (< ULTIMATE.start_main_~x~0 100000) (<= 2 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~y~0) (= 0 |ULTIMATE.start_main_~#a~0.offset|) (<= 0 ULTIMATE.start_main_~x~0) (<= 1 |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 400000)) [2020-07-01 11:14:58,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 15) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point L10-4(lines 10 15) no Hoare annotation was computed. [2020-07-01 11:14:58,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 11:14:58,879 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-01 11:14:58,881 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:14:58,890 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:58,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:58,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:14:58 BasicIcfg [2020-07-01 11:14:58,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:14:58,910 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:14:58,910 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:14:58,914 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:14:58,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:14:58,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:14:52" (1/5) ... [2020-07-01 11:14:58,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49fbdc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:14:58, skipping insertion in model container [2020-07-01 11:14:58,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:14:58,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:14:52" (2/5) ... [2020-07-01 11:14:58,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49fbdc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:14:58, skipping insertion in model container [2020-07-01 11:14:58,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:14:58,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:14:53" (3/5) ... [2020-07-01 11:14:58,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49fbdc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:14:58, skipping insertion in model container [2020-07-01 11:14:58,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:14:58,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:14:53" (4/5) ... [2020-07-01 11:14:58,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49fbdc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:14:58, skipping insertion in model container [2020-07-01 11:14:58,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:14:58,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:14:58" (5/5) ... [2020-07-01 11:14:58,918 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:14:58,940 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:14:58,940 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:14:58,940 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:14:58,940 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:14:58,940 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:14:58,940 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:14:58,940 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:14:58,941 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:14:58,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 11:14:58,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-01 11:14:58,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:58,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:58,953 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:14:58,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:14:58,954 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:14:58,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 11:14:58,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-01 11:14:58,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:58,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:58,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:14:58,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:14:58,961 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [144] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [181] L-1-->L9-3: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 400000) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|) (= v_ULTIMATE.start_main_~swapped~0_1 1) (< 0 |v_ULTIMATE.start_main_~#a~0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#a~0.base_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_~t~0=v_ULTIMATE.start_main_~t~0_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~swapped~0=v_ULTIMATE.start_main_~swapped~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_~t~0, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~swapped~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 4#L9-3true [2020-07-01 11:14:58,961 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-3true [182] L9-3-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~swapped~0_5 0) (= v_ULTIMATE.start_main_~i~0_2 1) (< 0 v_ULTIMATE.start_main_~swapped~0_6)) InVars {ULTIMATE.start_main_~swapped~0=v_ULTIMATE.start_main_~swapped~0_6} OutVars{ULTIMATE.start_main_~swapped~0=v_ULTIMATE.start_main_~swapped~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~swapped~0, ULTIMATE.start_main_~i~0] 6#L9-2true [158] L9-2-->L9-3: Formula: (>= v_ULTIMATE.start_main_~i~0_3 100000) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_3} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_3} AuxVars[] AssignedVars[] 4#L9-3true [2020-07-01 11:14:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash 5606, now seen corresponding path program 1 times [2020-07-01 11:14:58,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:58,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327793395] [2020-07-01 11:14:58,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:58,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:58,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:58,987 INFO L82 PathProgramCache]: Analyzing trace with hash 6761, now seen corresponding path program 1 times [2020-07-01 11:14:58,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:58,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040869214] [2020-07-01 11:14:58,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:14:58,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040869214] [2020-07-01 11:14:58,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:58,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 11:14:58,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692127067] [2020-07-01 11:14:58,997 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:14:58,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:14:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:58,999 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 11:14:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:59,106 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2020-07-01 11:14:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:14:59,108 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 11:14:59,112 INFO L168 Benchmark]: Toolchain (without parser) took 6608.92 ms. Allocated memory was 649.6 MB in the beginning and 778.6 MB in the end (delta: 129.0 MB). Free memory was 556.3 MB in the beginning and 677.6 MB in the end (delta: -121.3 MB). Peak memory consumption was 7.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,112 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:14:59,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.32 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 556.3 MB in the beginning and 654.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.56 ms. Allocated memory is still 692.1 MB. Free memory was 654.1 MB in the beginning and 651.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,114 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 ms. Allocated memory is still 692.1 MB. Free memory was 651.4 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,114 INFO L168 Benchmark]: RCFGBuilder took 360.43 ms. Allocated memory is still 692.1 MB. Free memory was 650.0 MB in the beginning and 624.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,114 INFO L168 Benchmark]: BlockEncodingV2 took 120.08 ms. Allocated memory is still 692.1 MB. Free memory was 624.9 MB in the beginning and 614.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,115 INFO L168 Benchmark]: TraceAbstraction took 5525.21 ms. Allocated memory was 692.1 MB in the beginning and 778.6 MB in the end (delta: 86.5 MB). Free memory was 614.2 MB in the beginning and 702.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 299.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,115 INFO L168 Benchmark]: BuchiAutomizer took 200.37 ms. Allocated memory is still 778.6 MB. Free memory was 702.5 MB in the beginning and 677.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:14:59,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 46 locations, 55 edges - StatisticsResult: Encoded RCFG 35 locations, 59 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 326.32 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 556.3 MB in the beginning and 654.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.56 ms. Allocated memory is still 692.1 MB. Free memory was 654.1 MB in the beginning and 651.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.80 ms. Allocated memory is still 692.1 MB. Free memory was 651.4 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 360.43 ms. Allocated memory is still 692.1 MB. Free memory was 650.0 MB in the beginning and 624.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 120.08 ms. Allocated memory is still 692.1 MB. Free memory was 624.9 MB in the beginning and 614.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 5525.21 ms. Allocated memory was 692.1 MB in the beginning and 778.6 MB in the end (delta: 86.5 MB). Free memory was 614.2 MB in the beginning and 702.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 299.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 200.37 ms. Allocated memory is still 778.6 MB. Free memory was 702.5 MB in the beginning and 677.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant [2020-07-01 11:14:59,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 == \valid[a] && 1 <= swapped) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[a] == 400000) || ((((1 == \valid[a] && 2 <= i) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[a] == 400000) - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 11:14:59,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 == \valid[a] && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == i) && unknown-#length-unknown[a] == 400000) || ((((1 == \valid[a] && 2 <= i) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[a] == 400000) - InvariantResult [Line: 21]: Loop Invariant [2020-07-01 11:14:59,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,131 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[a] && 2 <= i) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == x) && unknown-#length-unknown[a] == 400000) || ((((((1 == \valid[a] && 2 <= i) && 1 <= y) && 0 == a) && 0 <= x) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[a] == 400000) - InvariantResult [Line: 22]: Loop Invariant [2020-07-01 11:14:59,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:14:59,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:14:59,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 == \valid[a] && x < 100000) && 2 <= i) && 1 <= y) && 0 == a) && 0 <= x) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[a] == 400000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.1s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 645 SDslu, 391 SDs, 0 SdLazy, 936 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 83 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 161 HoareAnnotationTreeSize, 4 FomulaSimplifications, 400 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 493 ConstructedInterpolants, 0 QuantifiedInterpolants, 51959 SizeOfPredicates, 5 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 13 PerfectInterpolantSequences, 226/462 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 11:14:49.262 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_4weMSn/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:14:59.359 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check