YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:19:09,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:19:09,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:19:09,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:19:09,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:19:09,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:19:09,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:19:09,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:19:09,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:19:09,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:19:09,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:19:09,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:19:09,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:19:09,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:19:09,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:19:09,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:19:09,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:19:09,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:19:09,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:19:09,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:19:09,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:19:09,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:19:09,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:19:09,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:19:09,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:19:09,479 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:19:09,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:19:09,480 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:19:09,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:19:09,481 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:19:09,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:19:09,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:19:09,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:19:09,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:19:09,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:19:09,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:19:09,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:19:09,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:19:09,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:19:09,486 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 02:19:09,500 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:19:09,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:19:09,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:19:09,502 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:19:09,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:19:09,502 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:19:09,502 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:19:09,502 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:19:09,502 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:19:09,503 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:19:09,503 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:19:09,503 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:19:09,503 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:19:09,503 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:19:09,504 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:09,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:19:09,504 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:19:09,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:19:09,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:19:09,504 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:19:09,505 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:19:09,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:19:09,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:19:09,505 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:19:09,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:19:09,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:19:09,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:19:09,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:19:09,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:19:09,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:19:09,544 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:19:09,548 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:19:09,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:19:09,549 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:19:09,550 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:19:09,610 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6f87bb3909e544af9f3a916ef1c7c17b/FLAG6b2ce1c52 [2020-06-22 02:19:09,959 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:19:09,960 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:19:09,966 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6f87bb3909e544af9f3a916ef1c7c17b/FLAG6b2ce1c52 [2020-06-22 02:19:10,386 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6f87bb3909e544af9f3a916ef1c7c17b [2020-06-22 02:19:10,397 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:19:10,399 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:19:10,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:19:10,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:19:10,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:19:10,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6ed0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10, skipping insertion in model container [2020-06-22 02:19:10,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:19:10,433 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:19:10,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:19:10,590 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:19:10,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:19:10,674 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:19:10,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10 WrapperNode [2020-06-22 02:19:10,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:19:10,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:19:10,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:19:10,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:19:10,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:19:10,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:19:10,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:19:10,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:19:10,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:19:10,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:19:10,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:19:10,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:19:10,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (1/1) ... No working directory specified, using /export/starexec/sandbox/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-06-22 02:19:10,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:19:10,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:19:10,936 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:19:10,937 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 02:19:10,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:19:10 BoogieIcfgContainer [2020-06-22 02:19:10,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:19:10,939 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:19:10,939 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:19:10,941 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:19:10,942 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:19:10" (1/1) ... [2020-06-22 02:19:10,959 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 02:19:10,961 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:19:10,961 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:19:10,962 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:19:10,962 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:19:10,964 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:19:10,965 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:19:10,965 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:19:10,982 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:19:10,999 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 02:19:11,003 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:19:11,005 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:19:11,015 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:19:11,017 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 02:19:11,018 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:19:11,018 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:19:11,018 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:19:11,019 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:19:11,019 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 02:19:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:19:11 BasicIcfg [2020-06-22 02:19:11,020 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:19:11,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:19:11,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:19:11,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:19:11,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:19:10" (1/4) ... [2020-06-22 02:19:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a089ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (2/4) ... [2020-06-22 02:19:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a089ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:19:10" (3/4) ... [2020-06-22 02:19:11,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a089ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:19:11" (4/4) ... [2020-06-22 02:19:11,028 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:19:11,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:19:11,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:19:11,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:19:11,094 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:19:11,095 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:19:11,095 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:19:11,095 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:19:11,095 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:19:11,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:19:11,096 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:19:11,096 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:19:11,096 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:19:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 02:19:11,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:19:11,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 02:19:11,167 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 27) no Hoare annotation was computed. [2020-06-22 02:19:11,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:19:11,167 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2020-06-22 02:19:11,168 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 16 28) the Hoare annotation is: true [2020-06-22 02:19:11,168 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-06-22 02:19:11,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:19:11 BasicIcfg [2020-06-22 02:19:11,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:19:11,177 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:19:11,177 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:19:11,180 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:19:11,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:19:11,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:19:10" (1/5) ... [2020-06-22 02:19:11,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7126c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:19:11,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:19:10" (2/5) ... [2020-06-22 02:19:11,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7126c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:19:11,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:19:10" (3/5) ... [2020-06-22 02:19:11,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7126c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:19:11,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:19:11" (4/5) ... [2020-06-22 02:19:11,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7126c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:19:11, skipping insertion in model container [2020-06-22 02:19:11,184 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:19:11,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:19:11" (5/5) ... [2020-06-22 02:19:11,185 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:19:11,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:19:11,212 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:19:11,212 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:19:11,212 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:19:11,212 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:19:11,212 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:19:11,212 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:19:11,212 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:19:11,213 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:19:11,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 02:19:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:19:11,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:11,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:11,240 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:19:11,240 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:11,241 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:19:11,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 02:19:11,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:19:11,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:11,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:11,242 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:19:11,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:11,247 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 3#L23-2true [2020-06-22 02:19:11,248 INFO L796 eck$LassoCheckResult]: Loop: 3#L23-2true [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 5#L17true [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 6#L23true [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 3#L23-2true [2020-06-22 02:19:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-06-22 02:19:11,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:11,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 1 times [2020-06-22 02:19:11,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:11,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2092883, now seen corresponding path program 1 times [2020-06-22 02:19:11,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:11,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:11,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:11,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:11,411 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:11,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:11,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:11,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:11,412 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:11,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:11,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:11,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:11,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:19:11,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:11,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:11,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:11,530 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:11,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:11,537 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:11,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:11,572 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:11,606 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:11,609 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:11,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:11,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:11,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:11,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:11,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:11,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:11,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:11,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:19:11,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:11,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:11,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:11,700 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:11,706 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:11,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:11,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:11,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:11,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:11,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:11,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:11,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:11,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:11,720 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:11,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:11,728 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:19:11,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:11,730 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:11,731 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:11,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:19:11,733 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:11,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:11,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:11,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:11,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:11,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:11,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:11,879 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:11,884 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:11,886 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. [2020-06-22 02:19:11,950 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 8 states. [2020-06-22 02:19:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:19:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 02:19:11,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 02:19:11,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:11,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:19:11,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:11,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 02:19:11,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:11,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. [2020-06-22 02:19:11,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 02:19:11,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 32 transitions. [2020-06-22 02:19:11,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 02:19:11,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 02:19:11,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 32 transitions. [2020-06-22 02:19:11,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:11,972 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 32 transitions. [2020-06-22 02:19:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 32 transitions. [2020-06-22 02:19:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2020-06-22 02:19:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 02:19:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-06-22 02:19:12,002 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 02:19:12,002 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 02:19:12,002 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:19:12,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. [2020-06-22 02:19:12,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:19:12,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:12,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:12,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 02:19:12,004 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:12,004 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 77#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 73#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 78#L19 [2020-06-22 02:19:12,004 INFO L796 eck$LassoCheckResult]: Loop: 78#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 81#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 82#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 78#L19 [2020-06-22 02:19:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 1 times [2020-06-22 02:19:12,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash 85754, now seen corresponding path program 1 times [2020-06-22 02:19:12,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:12,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:19:12,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 02:19:12,063 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:19:12,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:19:12,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:19:12,067 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-06-22 02:19:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:19:12,092 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2020-06-22 02:19:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:19:12,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 38 transitions. [2020-06-22 02:19:12,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:19:12,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 36 transitions. [2020-06-22 02:19:12,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:19:12,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 02:19:12,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 36 transitions. [2020-06-22 02:19:12,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:12,098 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 02:19:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 36 transitions. [2020-06-22 02:19:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 02:19:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 02:19:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2020-06-22 02:19:12,101 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 02:19:12,101 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 02:19:12,101 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:19:12,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 36 transitions. [2020-06-22 02:19:12,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:19:12,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:12,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:12,102 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 02:19:12,102 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:12,103 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 113#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 109#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 121#L19 [2020-06-22 02:19:12,103 INFO L796 eck$LassoCheckResult]: Loop: 121#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 118#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 124#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 121#L19 [2020-06-22 02:19:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 2 times [2020-06-22 02:19:12,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 74222, now seen corresponding path program 1 times [2020-06-22 02:19:12,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:19:12,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2010787976, now seen corresponding path program 1 times [2020-06-22 02:19:12,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,165 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:12,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:12,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:12,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:12,166 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:12,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:12,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:12,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:19:12,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:12,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:12,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:12,235 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,256 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,284 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,323 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,358 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,386 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:12,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,465 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:12,467 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:12,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:12,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:12,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:12,467 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:12,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:12,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:12,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:12,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:19:12,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:12,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:12,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:12,542 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:12,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:12,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:12,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:12,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:12,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:12,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:12,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:12,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:12,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:12,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:12,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:12,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:12,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:12,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:12,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:12,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:12,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:12,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:12,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:12,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:12,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:12,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:12,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:12,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:12,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:12,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:12,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:12,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:12,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:12,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:12,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:12,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:12,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:12,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:12,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:12,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:12,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:12,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:12,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:12,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:12,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:12,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:12,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:12,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:12,567 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:12,571 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:12,572 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:19:12,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:12,572 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:12,572 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:12,572 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:19:12,573 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:12,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:12,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:12,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:12,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:12,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:12,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:12,673 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:12,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:12,673 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 21 Second operand 4 states. [2020-06-22 02:19:12,745 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 32 states and 67 transitions. Complement of second has 8 states. [2020-06-22 02:19:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:19:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 02:19:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 02:19:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 02:19:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 02:19:12,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:12,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 67 transitions. [2020-06-22 02:19:12,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 02:19:12,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 48 transitions. [2020-06-22 02:19:12,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:19:12,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 02:19:12,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 48 transitions. [2020-06-22 02:19:12,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:12,753 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 48 transitions. [2020-06-22 02:19:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 48 transitions. [2020-06-22 02:19:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 02:19:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 02:19:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2020-06-22 02:19:12,757 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 46 transitions. [2020-06-22 02:19:12,757 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 46 transitions. [2020-06-22 02:19:12,757 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:19:12,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 46 transitions. [2020-06-22 02:19:12,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 02:19:12,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:12,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:12,759 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 02:19:12,759 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 02:19:12,759 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 214#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 225#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 221#L19 [2020-06-22 02:19:12,760 INFO L796 eck$LassoCheckResult]: Loop: 221#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 209#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 210#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 215#L23 [59] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_7 0) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet7_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_3|} OutVars{ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 218#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 229#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 221#L19 [2020-06-22 02:19:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 67495, now seen corresponding path program 3 times [2020-06-22 02:19:12,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1739735341, now seen corresponding path program 1 times [2020-06-22 02:19:12,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:19:12,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1819800057, now seen corresponding path program 1 times [2020-06-22 02:19:12,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:12,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:12,870 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:12,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:12,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:12,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:12,871 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:12,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:12,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:12,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:19:12,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:12,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:12,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:12,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:12,957 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:12,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:12,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:12,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:12,998 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,029 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:13,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:13,083 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~n~0=1} Honda state: {ULTIMATE.start_main_~y~0=1, ULTIMATE.start_main_~n~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,088 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:13,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,170 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:13,172 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:13,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:13,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:13,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:13,172 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:13,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:13,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:13,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:13,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:19:13,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:13,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:13,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:13,298 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:13,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,319 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:13,321 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:13,322 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:19:13,322 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:13,322 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:13,322 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:13,323 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 02:19:13,323 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,447 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:13,447 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:13,447 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 46 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-06-22 02:19:13,492 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 46 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 57 states and 107 transitions. Complement of second has 12 states. [2020-06-22 02:19:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:19:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 02:19:13,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 02:19:13,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 02:19:13,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 12 letters. [2020-06-22 02:19:13,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 107 transitions. [2020-06-22 02:19:13,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-06-22 02:19:13,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 48 states and 91 transitions. [2020-06-22 02:19:13,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 02:19:13,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:19:13,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 91 transitions. [2020-06-22 02:19:13,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:13,501 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-06-22 02:19:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 91 transitions. [2020-06-22 02:19:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-06-22 02:19:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 02:19:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2020-06-22 02:19:13,505 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 73 transitions. [2020-06-22 02:19:13,505 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 73 transitions. [2020-06-22 02:19:13,505 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:19:13,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 73 transitions. [2020-06-22 02:19:13,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:19:13,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:13,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:13,507 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:19:13,507 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:13,508 INFO L794 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 397#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 410#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 411#L19 [58] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 402#L23-2 [2020-06-22 02:19:13,508 INFO L796 eck$LassoCheckResult]: Loop: 402#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 398#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 399#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 402#L23-2 [2020-06-22 02:19:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2092403, now seen corresponding path program 1 times [2020-06-22 02:19:13,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 2 times [2020-06-22 02:19:13,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:13,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2089694363, now seen corresponding path program 1 times [2020-06-22 02:19:13,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:19:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,562 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:13,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:13,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:13,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:13,562 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:13,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,563 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:13,563 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:13,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:19:13,563 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:13,563 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:13,613 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:13,646 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:13,654 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=0} Honda state: {ULTIMATE.start_main_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:13,683 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:13,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:13,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:13,745 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:13,747 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:13,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:13,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:13,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:13,747 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:13,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:13,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:13,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:13,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:19:13,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:13,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:13,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:13,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:13,801 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:13,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:13,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:13,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:13,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:13,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:13,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:13,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:13,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:13,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:13,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:13,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:13,814 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:19:13,814 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:13,814 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:13,815 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:13,815 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:19:13,815 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:13,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:13,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:13,890 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:13,890 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:13,891 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 73 transitions. cyclomatic complexity: 42 Second operand 4 states. [2020-06-22 02:19:13,943 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 73 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 103 states and 174 transitions. Complement of second has 14 states. [2020-06-22 02:19:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:19:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 02:19:13,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:19:13,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 02:19:13,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 02:19:13,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:13,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 174 transitions. [2020-06-22 02:19:13,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:19:13,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 126 transitions. [2020-06-22 02:19:13,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 02:19:13,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 02:19:13,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 126 transitions. [2020-06-22 02:19:13,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:13,953 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 126 transitions. [2020-06-22 02:19:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 126 transitions. [2020-06-22 02:19:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2020-06-22 02:19:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 02:19:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2020-06-22 02:19:13,958 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 97 transitions. [2020-06-22 02:19:13,959 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 97 transitions. [2020-06-22 02:19:13,959 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:19:13,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 97 transitions. [2020-06-22 02:19:13,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:19:13,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:13,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:13,961 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:19:13,961 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:13,961 INFO L794 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 596#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 634#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 633#L19 [57] L19-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_5 1) (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~b~0] 602#L23-2 [2020-06-22 02:19:13,962 INFO L796 eck$LassoCheckResult]: Loop: 602#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 612#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 601#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 602#L23-2 [2020-06-22 02:19:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2092402, now seen corresponding path program 1 times [2020-06-22 02:19:13,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 67095, now seen corresponding path program 3 times [2020-06-22 02:19:13,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2089724154, now seen corresponding path program 1 times [2020-06-22 02:19:13,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:13,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:19:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:14,016 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:14,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:14,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:14,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:14,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:14,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:14,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:14,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:19:14,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:14,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:14,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:14,070 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:14,077 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:14,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:14,139 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:14,142 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:14,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:14,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:14,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:14,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:14,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:14,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:14,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:14,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:19:14,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:14,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:14,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:14,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:14,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:14,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:14,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:14,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:14,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:14,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:14,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:14,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:14,197 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:14,198 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:14,199 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:19:14,199 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:14,199 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:14,199 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:14,199 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:19:14,200 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,258 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:14,258 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:14,258 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 97 transitions. cyclomatic complexity: 53 Second operand 4 states. [2020-06-22 02:19:14,299 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 97 transitions. cyclomatic complexity: 53. Second operand 4 states. Result 113 states and 191 transitions. Complement of second has 14 states. [2020-06-22 02:19:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:19:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 02:19:14,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:19:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 02:19:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 02:19:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 191 transitions. [2020-06-22 02:19:14,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:19:14,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 81 states and 146 transitions. [2020-06-22 02:19:14,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 02:19:14,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 02:19:14,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 146 transitions. [2020-06-22 02:19:14,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:14,308 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 146 transitions. [2020-06-22 02:19:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 146 transitions. [2020-06-22 02:19:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2020-06-22 02:19:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 02:19:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-06-22 02:19:14,312 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-06-22 02:19:14,312 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-06-22 02:19:14,312 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:19:14,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 94 transitions. [2020-06-22 02:19:14,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:19:14,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:14,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:14,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:19:14,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 02:19:14,314 INFO L794 eck$LassoCheckResult]: Stem: 818#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 819#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 852#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 851#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 828#L23-2 [2020-06-22 02:19:14,315 INFO L796 eck$LassoCheckResult]: Loop: 828#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 833#L17 [56] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (> 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 834#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 838#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 835#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 826#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 828#L23-2 [2020-06-22 02:19:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2092390, now seen corresponding path program 2 times [2020-06-22 02:19:14,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:14,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1999787477, now seen corresponding path program 1 times [2020-06-22 02:19:14,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:14,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:19:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:14,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:19:14,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:19:14,336 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:19:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:19:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:19:14,336 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. cyclomatic complexity: 50 Second operand 3 states. [2020-06-22 02:19:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:19:14,362 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. [2020-06-22 02:19:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:19:14,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 101 transitions. [2020-06-22 02:19:14,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 02:19:14,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 49 states and 90 transitions. [2020-06-22 02:19:14,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 02:19:14,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 02:19:14,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 90 transitions. [2020-06-22 02:19:14,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:14,367 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. [2020-06-22 02:19:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 90 transitions. [2020-06-22 02:19:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-06-22 02:19:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 02:19:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2020-06-22 02:19:14,371 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. [2020-06-22 02:19:14,371 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. [2020-06-22 02:19:14,371 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 02:19:14,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 90 transitions. [2020-06-22 02:19:14,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 02:19:14,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:19:14,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:19:14,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 02:19:14,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:19:14,373 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~b~0] 933#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 929#L17 [39] L17-->L19: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_7 1) v_ULTIMATE.start_main_~y~0_6) (= 0 v_ULTIMATE.start_main_~b~0_4)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_4, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 949#L19 [45] L19-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 944#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 954#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 937#L23 [2020-06-22 02:19:14,373 INFO L796 eck$LassoCheckResult]: Loop: 937#L23 [42] L23-->L23-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet7_5|) InVars {ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|} OutVars{ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7] 938#L23-2 [37] L23-2-->L17: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= v_ULTIMATE.start_main_~y~0_5 v_ULTIMATE.start_main_~n~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 953#L17 [55] L17-->L23: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_8 1)) (< 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post6] 937#L23 [2020-06-22 02:19:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2010787992, now seen corresponding path program 1 times [2020-06-22 02:19:14,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:14,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:14,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:19:14,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:19:14,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 02:19:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash 71355, now seen corresponding path program 4 times [2020-06-22 02:19:14,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:19:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:19:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:19:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:19:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:19:14,425 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:14,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:14,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:14,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:14,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:19:14,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:14,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:14,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 02:19:14,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:14,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:14,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:14,471 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:14,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:14,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:19:14,478 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=0} Honda state: {ULTIMATE.start_main_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:19:14,504 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:19:14,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:19:14,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:19:14,563 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:19:14,564 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:19:14,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:19:14,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:19:14,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:19:14,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:19:14,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:19:14,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:19:14,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:19:14,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 02:19:14,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:19:14,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:19:14,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:19:14,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:19:14,610 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:19:14,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:14,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:14,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:14,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:14,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:14,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:14,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:14,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:14,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:19:14,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:19:14,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:19:14,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:19:14,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:19:14,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:19:14,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:19:14,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:19:14,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:19:14,617 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:19:14,619 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:19:14,619 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:19:14,619 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:19:14,619 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:19:14,620 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:19:14,620 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:19:14,620 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:19:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:19:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:19:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:19:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:19:14,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:19:14,677 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:19:14,677 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:19:14,677 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46 Second operand 4 states. [2020-06-22 02:19:14,719 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46. Second operand 4 states. Result 132 states and 226 transitions. Complement of second has 8 states. [2020-06-22 02:19:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 02:19:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:19:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-06-22 02:19:14,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 02:19:14,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 02:19:14,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 02:19:14,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:19:14,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2020-06-22 02:19:14,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:19:14,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 78 states and 141 transitions. [2020-06-22 02:19:14,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 02:19:14,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:19:14,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 141 transitions. [2020-06-22 02:19:14,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:19:14,726 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 141 transitions. [2020-06-22 02:19:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 141 transitions. [2020-06-22 02:19:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. [2020-06-22 02:19:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 02:19:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 78 transitions. [2020-06-22 02:19:14,730 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 78 transitions. [2020-06-22 02:19:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:19:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:19:14,731 INFO L87 Difference]: Start difference. First operand 41 states and 78 transitions. Second operand 3 states. [2020-06-22 02:19:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:19:14,747 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. [2020-06-22 02:19:14,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:19:14,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. [2020-06-22 02:19:14,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:19:14,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-06-22 02:19:14,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:19:14,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:19:14,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:19:14,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:19:14,750 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:19:14,750 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:19:14,750 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:19:14,750 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 02:19:14,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:19:14,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:19:14,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:19:14,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:19:14 BasicIcfg [2020-06-22 02:19:14,756 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:19:14,757 INFO L168 Benchmark]: Toolchain (without parser) took 4358.95 ms. Allocated memory was 649.6 MB in the beginning and 746.6 MB in the end (delta: 97.0 MB). Free memory was 559.7 MB in the beginning and 424.3 MB in the end (delta: 135.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,759 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:19:14,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.47 ms. Allocated memory was 649.6 MB in the beginning and 667.4 MB in the end (delta: 17.8 MB). Free memory was 558.6 MB in the beginning and 634.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.21 ms. Allocated memory is still 667.4 MB. Free memory was 634.4 MB in the beginning and 631.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,760 INFO L168 Benchmark]: Boogie Preprocessor took 18.93 ms. Allocated memory is still 667.4 MB. Free memory was 631.5 MB in the beginning and 630.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,761 INFO L168 Benchmark]: RCFGBuilder took 208.81 ms. Allocated memory is still 667.4 MB. Free memory was 629.3 MB in the beginning and 615.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,761 INFO L168 Benchmark]: BlockEncodingV2 took 81.19 ms. Allocated memory is still 667.4 MB. Free memory was 615.6 MB in the beginning and 610.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,762 INFO L168 Benchmark]: TraceAbstraction took 155.57 ms. Allocated memory is still 667.4 MB. Free memory was 610.2 MB in the beginning and 601.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,762 INFO L168 Benchmark]: BuchiAutomizer took 3579.81 ms. Allocated memory was 667.4 MB in the beginning and 746.6 MB in the end (delta: 79.2 MB). Free memory was 601.5 MB in the beginning and 424.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 256.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:19:14,766 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 275.47 ms. Allocated memory was 649.6 MB in the beginning and 667.4 MB in the end (delta: 17.8 MB). Free memory was 558.6 MB in the beginning and 634.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.21 ms. Allocated memory is still 667.4 MB. Free memory was 634.4 MB in the beginning and 631.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.93 ms. Allocated memory is still 667.4 MB. Free memory was 631.5 MB in the beginning and 630.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 208.81 ms. Allocated memory is still 667.4 MB. Free memory was 629.3 MB in the beginning and 615.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 81.19 ms. Allocated memory is still 667.4 MB. Free memory was 615.6 MB in the beginning and 610.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 155.57 ms. Allocated memory is still 667.4 MB. Free memory was 610.2 MB in the beginning and 601.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3579.81 ms. Allocated memory was 667.4 MB in the beginning and 746.6 MB in the end (delta: 79.2 MB). Free memory was 601.5 MB in the beginning and 424.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 256.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (3 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 63 SDtfs, 122 SDslu, 100 SDs, 0 SdLazy, 258 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:19:07.146 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:19:14.998 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check