/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:39:22,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:39:22,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:39:22,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:39:22,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:39:22,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:39:22,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:39:22,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:39:22,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:39:22,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:39:22,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:39:22,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:39:22,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:39:22,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:39:22,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:39:22,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:39:22,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:39:22,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:39:22,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:39:22,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:39:22,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:39:22,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:39:22,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:39:22,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:39:22,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:39:22,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:39:22,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:39:22,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:39:22,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:39:22,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:39:22,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:39:22,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:39:22,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:39:22,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:39:22,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:39:22,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:39:22,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:39:22,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:39:22,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:39:22,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:39:22,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:39:22,398 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 11:39:22,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:39:22,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:39:22,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:39:22,414 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:39:22,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:39:22,415 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:39:22,415 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:39:22,415 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:39:22,415 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:39:22,415 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:39:22,416 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:39:22,416 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:39:22,416 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:39:22,416 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:39:22,416 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:22,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:39:22,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:39:22,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:39:22,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:39:22,417 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:39:22,417 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:39:22,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:39:22,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:39:22,418 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:39:22,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:39:22,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:39:22,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:39:22,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:39:22,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:39:22,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:39:22,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:39:22,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:39:22,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:39:22,605 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:39:22,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:39:22,669 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_1IY5TS/tmp/e7a59ed6551645cf8037cdce45a17bfa/FLAG35a229c6a [2020-07-01 11:39:22,999 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:39:23,000 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:39:23,006 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_1IY5TS/tmp/e7a59ed6551645cf8037cdce45a17bfa/FLAG35a229c6a [2020-07-01 11:39:23,401 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_1IY5TS/tmp/e7a59ed6551645cf8037cdce45a17bfa [2020-07-01 11:39:23,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:39:23,414 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:39:23,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:39:23,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:39:23,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:39:23,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e5d678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23, skipping insertion in model container [2020-07-01 11:39:23,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:39:23,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:39:23,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:39:23,679 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:39:23,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:39:23,710 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:39:23,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23 WrapperNode [2020-07-01 11:39:23,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:39:23,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:39:23,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:39:23,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:39:23,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:39:23,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:39:23,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:39:23,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:39:23,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:39:23,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:39:23,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:39:23,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:39:23,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (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-07-01 11:39:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:39:23,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:39:23,973 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:39:23,973 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 11:39:23,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:23 BoogieIcfgContainer [2020-07-01 11:39:23,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:39:23,978 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:39:23,978 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:39:23,980 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:39:23,981 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:23" (1/1) ... [2020-07-01 11:39:23,993 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges [2020-07-01 11:39:23,995 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:39:23,996 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:39:23,996 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:39:23,997 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:39:23,998 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:39:23,999 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:39:24,000 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:39:24,013 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:39:24,020 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 11:39:24,025 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:39:24,027 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:39:24,042 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 11:39:24,044 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 11:39:24,046 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:39:24,046 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:39:24,046 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:39:24,046 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:39:24,047 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-07-01 11:39:24,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:24 BasicIcfg [2020-07-01 11:39:24,047 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:39:24,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:39:24,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:39:24,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:39:24,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:39:23" (1/4) ... [2020-07-01 11:39:24,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a61c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (2/4) ... [2020-07-01 11:39:24,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a61c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:23" (3/4) ... [2020-07-01 11:39:24,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a61c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:24" (4/4) ... [2020-07-01 11:39:24,056 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:39:24,066 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:39:24,074 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:39:24,088 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:39:24,112 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:39:24,112 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:39:24,112 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:39:24,112 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:39:24,112 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:39:24,113 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:39:24,113 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:39:24,113 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:39:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-07-01 11:39:24,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:39:24,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-07-01 11:39:24,186 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:39:24,186 INFO L268 CegarLoopResult]: For program point L12(lines 12 18) no Hoare annotation was computed. [2020-07-01 11:39:24,187 INFO L271 CegarLoopResult]: At program point L12-2(lines 11 19) the Hoare annotation is: true [2020-07-01 11:39:24,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:24 BasicIcfg [2020-07-01 11:39:24,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:39:24,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:39:24,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:39:24,200 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:39:24,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:24,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:39:23" (1/5) ... [2020-07-01 11:39:24,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1a58d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:24,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:23" (2/5) ... [2020-07-01 11:39:24,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1a58d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:24,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:23" (3/5) ... [2020-07-01 11:39:24,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1a58d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:24,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:24" (4/5) ... [2020-07-01 11:39:24,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1a58d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:24, skipping insertion in model container [2020-07-01 11:39:24,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:24,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:24" (5/5) ... [2020-07-01 11:39:24,205 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:39:24,233 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:39:24,234 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:39:24,234 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:39:24,234 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:39:24,236 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:39:24,236 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:39:24,237 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:39:24,237 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:39:24,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-01 11:39:24,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:39:24,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:24,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:24,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:39:24,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:39:24,265 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:39:24,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-01 11:39:24,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:39:24,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:24,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:24,266 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:39:24,266 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:39:24,271 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-07-01 11:39:24,271 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 5#L12true [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-07-01 11:39:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2020-07-01 11:39:24,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:24,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542580068] [2020-07-01 11:39:24,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,362 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 1 times [2020-07-01 11:39:24,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:24,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99173195] [2020-07-01 11:39:24,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,381 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:24,383 INFO L82 PathProgramCache]: Analyzing trace with hash 57539, now seen corresponding path program 1 times [2020-07-01 11:39:24,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:24,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575570323] [2020-07-01 11:39:24,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:24,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:24,445 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:24,446 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:24,446 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:24,446 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:24,446 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:24,446 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:24,447 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:24,447 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:24,447 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:39:24,447 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:24,447 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:24,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,593 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:24,594 INFO L404 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-07-01 11:39:24,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:24,600 INFO L160 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-07-01 11:39:24,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:24,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:24,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:24,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 10, 14] Nus: [1, 0] 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-07-01 11:39:24,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:24,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:24,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:24,694 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=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-07-01 11:39:24,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:24,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:24,732 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:24,732 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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-07-01 11:39:24,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:24,766 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 11:39:24,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:24,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:24,839 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:24,841 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:24,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:24,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:24,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:24,842 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:24,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:24,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:24,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:24,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:39:24,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:24,843 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:24,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:24,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:24,942 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:24,959 INFO L120 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-07-01 11:39:24,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:24,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:24,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:24,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:24,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:24,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:24,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:24,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,003 INFO L120 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-07-01 11:39:25,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:25,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:25,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,047 INFO L120 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-07-01 11:39:25,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:25,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:25,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,091 INFO L120 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-07-01 11:39:25,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:25,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:25,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:25,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:25,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:25,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:25,109 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:25,109 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:25,110 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-07-01 11:39:25,144 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:25,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:25,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:25,198 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:39:25,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:25,213 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-07-01 11:39:25,219 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 1 loop predicates [2020-07-01 11:39:25,220 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-07-01 11:39:25,249 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. [2020-07-01 11:39:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 11:39:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:39:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-01 11:39:25,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-01 11:39:25,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:25,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 11:39:25,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:25,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-01 11:39:25,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:25,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2020-07-01 11:39:25,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:39:25,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2020-07-01 11:39:25,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 11:39:25,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 11:39:25,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-01 11:39:25,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:25,271 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 11:39:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-01 11:39:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-01 11:39:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:39:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-01 11:39:25,299 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 11:39:25,300 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 11:39:25,300 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:39:25,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-01 11:39:25,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:39:25,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:25,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:25,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:39:25,302 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:39:25,302 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 47#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 45#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 [2020-07-01 11:39:25,302 INFO L796 eck$LassoCheckResult]: Loop: 41#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 42#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 [2020-07-01 11:39:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash 57534, now seen corresponding path program 1 times [2020-07-01 11:39:25,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:25,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32835394] [2020-07-01 11:39:25,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:25,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 2 times [2020-07-01 11:39:25,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:25,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920106461] [2020-07-01 11:39:25,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:25,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash 55291014, now seen corresponding path program 1 times [2020-07-01 11:39:25,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:25,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644707670] [2020-07-01 11:39:25,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:25,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644707670] [2020-07-01 11:39:25,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:25,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:39:25,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546515517] [2020-07-01 11:39:25,389 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:25,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:25,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:25,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:25,390 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:25,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:25,390 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:25,390 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:25,390 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:39:25,390 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:25,391 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:25,471 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-01 11:39:25,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:25,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:25,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:25,491 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} 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-07-01 11:39:25,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:25,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:25,533 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:25,533 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-01 11:39:25,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:25,570 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 11:39:25,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:25,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:25,621 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:25,621 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 10, 14] Nus: [1, 0] 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-07-01 11:39:25,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:25,661 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 11:39:25,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:25,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:25,736 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:25,738 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:25,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:25,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:25,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:25,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:25,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:25,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:25,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:39:25,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:25,739 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:25,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:25,825 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:25,825 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,831 INFO L120 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-07-01 11:39:25,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:25,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:25,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,878 INFO L120 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-07-01 11:39:25,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:25,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:25,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:25,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,920 INFO L120 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-07-01 11:39:25,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:25,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:25,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:25,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:25,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:25,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:25,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:25,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:25,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:25,934 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 11:39:25,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:25,940 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:25,940 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:25,940 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-07-01 11:39:25,972 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:25,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:25,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,008 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:26,009 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-07-01 11:39:26,010 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 1 loop predicates [2020-07-01 11:39:26,010 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-01 11:39:26,022 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. [2020-07-01 11:39:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 11:39:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:39:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-01 11:39:26,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 11:39:26,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-01 11:39:26,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 11:39:26,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2020-07-01 11:39:26,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:39:26,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2020-07-01 11:39:26,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 11:39:26,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 11:39:26,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-07-01 11:39:26,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:26,029 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-01 11:39:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-07-01 11:39:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. [2020-07-01 11:39:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:39:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-07-01 11:39:26,030 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-01 11:39:26,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:26,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:39:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:39:26,034 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2020-07-01 11:39:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:26,055 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-01 11:39:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:39:26,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-07-01 11:39:26,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:39:26,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. [2020-07-01 11:39:26,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 11:39:26,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-01 11:39:26,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-07-01 11:39:26,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:26,059 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 11:39:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-07-01 11:39:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-01 11:39:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 11:39:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-01 11:39:26,060 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-01 11:39:26,061 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-01 11:39:26,061 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:39:26,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-01 11:39:26,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:39:26,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:26,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:26,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 11:39:26,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:39:26,062 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 107#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 108#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 109#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 [2020-07-01 11:39:26,062 INFO L796 eck$LassoCheckResult]: Loop: 110#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 112#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 [2020-07-01 11:39:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 2 times [2020-07-01 11:39:26,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992675638] [2020-07-01 11:39:26,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1886, now seen corresponding path program 1 times [2020-07-01 11:39:26,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568980817] [2020-07-01 11:39:26,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,081 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1714170260, now seen corresponding path program 2 times [2020-07-01 11:39:26,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267746497] [2020-07-01 11:39:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,094 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,114 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:26,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:26,115 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:26,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:26,115 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:26,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:26,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:26,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:26,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 11:39:26,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:26,116 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:26,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,185 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:26,185 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-01 11:39:26,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:26,191 INFO L160 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-07-01 11:39:26,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:26,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:26,263 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:26,265 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:26,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:26,265 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:26,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:26,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:26,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:26,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:26,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 11:39:26,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:26,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:26,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:26,376 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,382 INFO L120 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-07-01 11:39:26,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:26,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:26,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:26,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:26,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:26,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:26,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:26,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:26,392 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:39:26,393 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:26,399 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:26,399 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:26,399 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-01 11:39:26,429 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,459 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:26,510 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:39:26,510 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-07-01 11:39:26,510 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-01 11:39:26,520 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2020-07-01 11:39:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 11:39:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:39:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-01 11:39:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-01 11:39:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-01 11:39:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:39:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:26,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-07-01 11:39:26,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 11:39:26,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2020-07-01 11:39:26,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-01 11:39:26,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-01 11:39:26,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-01 11:39:26,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:26,526 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-01 11:39:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-01 11:39:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-01 11:39:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:39:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-01 11:39:26,527 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 11:39:26,527 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 11:39:26,527 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:39:26,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-01 11:39:26,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:39:26,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:26,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:26,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 11:39:26,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-01 11:39:26,529 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 163#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 [2020-07-01 11:39:26,529 INFO L796 eck$LassoCheckResult]: Loop: 168#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 165#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 [2020-07-01 11:39:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 3 times [2020-07-01 11:39:26,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270504423] [2020-07-01 11:39:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1813526, now seen corresponding path program 1 times [2020-07-01 11:39:26,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613424275] [2020-07-01 11:39:26,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1949820724, now seen corresponding path program 3 times [2020-07-01 11:39:26,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:26,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054635366] [2020-07-01 11:39:26,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:26,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:26,617 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:26,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:26,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:26,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:26,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:26,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:26,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:26,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:26,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 11:39:26,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:26,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:26,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,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-07-01 11:39:26,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,696 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:26,696 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:26,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:26,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:26,703 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:26,704 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:26,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:26,735 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:26,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:26,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:26,775 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:26,804 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:26,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:26,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:26,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:26,804 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:26,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:26,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:26,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 11:39:26,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:26,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:26,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:26,866 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:26,866 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,869 INFO L120 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-07-01 11:39:26,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:26,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:26,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:26,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:26,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:26,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:26,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:26,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:26,878 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:26,879 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:26,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:26,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:26,889 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:26,889 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 221 Supporting invariants [] [2020-07-01 11:39:26,919 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:26,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:39:26,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:26,998 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:39:26,998 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 4 loop predicates [2020-07-01 11:39:26,998 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-01 11:39:27,023 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. [2020-07-01 11:39:27,024 INFO L141 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-07-01 11:39:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:39:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-01 11:39:27,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:39:27,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-01 11:39:27,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 11:39:27,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-07-01 11:39:27,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 11:39:27,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2020-07-01 11:39:27,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 11:39:27,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-01 11:39:27,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-07-01 11:39:27,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:27,031 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-01 11:39:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-07-01 11:39:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-01 11:39:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 11:39:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-01 11:39:27,033 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 11:39:27,033 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 11:39:27,033 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:39:27,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-01 11:39:27,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 11:39:27,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:27,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:27,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 11:39:27,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2020-07-01 11:39:27,034 INFO L794 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 253#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 260#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 258#L12 [2020-07-01 11:39:27,035 INFO L796 eck$LassoCheckResult]: Loop: 258#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 255#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 266#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 265#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 264#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 263#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 262#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 260#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 258#L12 [2020-07-01 11:39:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 4 times [2020-07-01 11:39:27,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074915749] [2020-07-01 11:39:27,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1368636088, now seen corresponding path program 2 times [2020-07-01 11:39:27,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496118963] [2020-07-01 11:39:27,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2050633346, now seen corresponding path program 4 times [2020-07-01 11:39:27,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292149438] [2020-07-01 11:39:27,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 11:39:27,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292149438] [2020-07-01 11:39:27,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064256915] [2020-07-01 11:39:27,111 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:27,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 11:39:27,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:39:27,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 11:39:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:39:27,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-01 11:39:27,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96736035] [2020-07-01 11:39:27,235 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:27,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:27,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:27,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:27,235 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:27,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:27,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:27,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:27,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:39:27,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:27,236 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:27,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:27,303 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:27,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:27,306 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:27,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:27,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:27,346 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:27,375 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:27,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:27,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:27,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:27,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:27,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:27,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:27,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:27,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 11:39:27,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:27,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:27,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:27,439 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:27,439 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:27,442 INFO L120 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-07-01 11:39:27,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:27,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:27,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:27,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:27,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:27,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:27,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:27,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:27,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:27,451 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:27,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:27,455 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:27,455 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:27,455 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-01 11:39:27,485 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:39:27,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:27,772 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-07-01 11:39:27,773 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 13 loop predicates [2020-07-01 11:39:27,773 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-01 11:39:27,854 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 129 states and 152 transitions. Complement of second has 34 states. [2020-07-01 11:39:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 11:39:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:39:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-01 11:39:27,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2020-07-01 11:39:27,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 14 letters. Loop has 10 letters. [2020-07-01 11:39:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 20 letters. [2020-07-01 11:39:27,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:27,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 152 transitions. [2020-07-01 11:39:27,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-01 11:39:27,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 64 states and 85 transitions. [2020-07-01 11:39:27,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 11:39:27,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-01 11:39:27,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 85 transitions. [2020-07-01 11:39:27,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:27,866 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 85 transitions. [2020-07-01 11:39:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 85 transitions. [2020-07-01 11:39:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2020-07-01 11:39:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 11:39:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2020-07-01 11:39:27,871 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2020-07-01 11:39:27,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:39:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:39:27,872 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand 5 states. [2020-07-01 11:39:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:27,892 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2020-07-01 11:39:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:39:27,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. [2020-07-01 11:39:27,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-07-01 11:39:27,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 49 states and 66 transitions. [2020-07-01 11:39:27,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-01 11:39:27,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-01 11:39:27,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. [2020-07-01 11:39:27,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:27,898 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2020-07-01 11:39:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. [2020-07-01 11:39:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-01 11:39:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 11:39:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2020-07-01 11:39:27,902 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2020-07-01 11:39:27,902 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2020-07-01 11:39:27,902 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:39:27,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2020-07-01 11:39:27,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-07-01 11:39:27,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:27,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:27,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-01 11:39:27,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2020-07-01 11:39:27,904 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 781#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 795#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 796#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 785#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 775#L12-2 [2020-07-01 11:39:27,905 INFO L796 eck$LassoCheckResult]: Loop: 775#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 777#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 800#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 799#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 797#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 788#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 786#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 785#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 775#L12-2 [2020-07-01 11:39:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 5 times [2020-07-01 11:39:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815883544] [2020-07-01 11:39:27,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1295692375, now seen corresponding path program 3 times [2020-07-01 11:39:27,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173647665] [2020-07-01 11:39:27,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:39:27,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173647665] [2020-07-01 11:39:27,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:27,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:39:27,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695649657] [2020-07-01 11:39:27,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:39:27,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:27,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:39:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:39:27,943 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-01 11:39:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:27,958 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2020-07-01 11:39:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:39:27,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2020-07-01 11:39:27,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-01 11:39:27,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 55 transitions. [2020-07-01 11:39:27,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 11:39:27,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-01 11:39:27,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2020-07-01 11:39:27,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:27,962 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-07-01 11:39:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2020-07-01 11:39:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-01 11:39:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 11:39:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-07-01 11:39:27,965 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-07-01 11:39:27,965 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-07-01 11:39:27,965 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 11:39:27,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2020-07-01 11:39:27,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-01 11:39:27,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:27,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:27,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-01 11:39:27,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 7, 5] [2020-07-01 11:39:27,967 INFO L794 eck$LassoCheckResult]: Stem: 884#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 885#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 908#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 894#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 888#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 879#L12-2 [2020-07-01 11:39:27,968 INFO L796 eck$LassoCheckResult]: Loop: 879#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 881#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 914#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 913#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 911#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 910#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 909#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 907#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 906#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 903#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 905#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 904#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 902#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 901#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 900#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 899#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 898#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 897#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 896#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 895#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 893#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 891#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 892#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 890#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 879#L12-2 [2020-07-01 11:39:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 6 times [2020-07-01 11:39:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190167474] [2020-07-01 11:39:27,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:27,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1147706558, now seen corresponding path program 4 times [2020-07-01 11:39:27,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:27,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69205364] [2020-07-01 11:39:27,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:28,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash 371039752, now seen corresponding path program 5 times [2020-07-01 11:39:28,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:28,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849228353] [2020-07-01 11:39:28,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 65 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:28,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849228353] [2020-07-01 11:39:28,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238732893] [2020-07-01 11:39:28,162 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:28,193 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2020-07-01 11:39:28,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:39:28,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 11:39:28,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:39:28,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:39:28,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2020-07-01 11:39:28,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793814318] [2020-07-01 11:39:28,624 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-01 11:39:28,639 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:28,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:28,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:28,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:28,640 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:28,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:28,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:28,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:28,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 11:39:28,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:28,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:28,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,699 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:28,699 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:28,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:28,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:28,706 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:28,706 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:28,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:28,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:28,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:39:28,741 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:28,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:28,773 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:28,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:28,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:28,881 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:28,883 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:28,883 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:28,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:28,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:28,883 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:28,883 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:28,884 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:28,884 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:28,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 11:39:28,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:28,884 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:28,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:28,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-07-01 11:39:28,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:28,943 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:28,946 INFO L120 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-07-01 11:39:28,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:28,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:28,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:28,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:28,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:28,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:28,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:28,985 INFO L120 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-07-01 11:39:28,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:28,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:28,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:28,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:28,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:28,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:28,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:29,025 INFO L120 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-07-01 11:39:29,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:29,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:29,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:29,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:29,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:29,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:29,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:29,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:29,035 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:29,035 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:29,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:29,037 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:29,037 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:29,037 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-01 11:39:29,066 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 72 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-01 11:39:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,707 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:29,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 11:39:29,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:29,927 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 23 predicates after loop cannibalization [2020-07-01 11:39:29,928 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 23 loop predicates [2020-07-01 11:39:29,928 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-01 11:39:30,935 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 861 states and 948 transitions. Complement of second has 218 states. [2020-07-01 11:39:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 20 non-accepting loop states 3 accepting loop states [2020-07-01 11:39:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:39:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2020-07-01 11:39:30,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 24 letters. [2020-07-01 11:39:30,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:30,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 29 letters. Loop has 24 letters. [2020-07-01 11:39:30,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:30,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 48 letters. [2020-07-01 11:39:30,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:30,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 948 transitions. [2020-07-01 11:39:30,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-07-01 11:39:30,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 66 states and 74 transitions. [2020-07-01 11:39:30,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-01 11:39:30,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-07-01 11:39:30,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2020-07-01 11:39:30,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:30,956 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2020-07-01 11:39:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2020-07-01 11:39:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 30. [2020-07-01 11:39:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:39:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-01 11:39:30,959 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-01 11:39:30,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-01 11:39:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2020-07-01 11:39:30,960 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 27 states. [2020-07-01 11:39:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:31,253 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2020-07-01 11:39:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-01 11:39:31,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2020-07-01 11:39:31,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2020-07-01 11:39:31,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 110 transitions. [2020-07-01 11:39:31,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-07-01 11:39:31,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-07-01 11:39:31,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 110 transitions. [2020-07-01 11:39:31,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:39:31,258 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 110 transitions. [2020-07-01 11:39:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 110 transitions. [2020-07-01 11:39:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 30. [2020-07-01 11:39:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:39:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-01 11:39:31,261 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-01 11:39:31,261 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-01 11:39:31,262 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 11:39:31,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2020-07-01 11:39:31,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-07-01 11:39:31,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:31,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:31,263 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1] [2020-07-01 11:39:31,263 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2020-07-01 11:39:31,263 INFO L794 eck$LassoCheckResult]: Stem: 3961#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3962#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3974#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3973#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3966#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3968#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3971#L12 [2020-07-01 11:39:31,264 INFO L796 eck$LassoCheckResult]: Loop: 3971#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3972#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3969#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3970#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3981#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3980#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3979#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3978#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3977#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3957#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3958#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3986#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3983#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3984#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3985#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3959#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3960#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3965#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3982#L12 [29] L12-->L12-2: Formula: (and (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3964#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3976#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3975#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3971#L12 [2020-07-01 11:39:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1714170415, now seen corresponding path program 7 times [2020-07-01 11:39:31,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:31,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895576395] [2020-07-01 11:39:31,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1334206585, now seen corresponding path program 5 times [2020-07-01 11:39:31,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:31,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663437058] [2020-07-01 11:39:31,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1706283829, now seen corresponding path program 6 times [2020-07-01 11:39:31,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:31,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046125693] [2020-07-01 11:39:31,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:31,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:31,500 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2020-07-01 11:39:31,513 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:31,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:31,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:31,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:31,513 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:39:31,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:31,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:31,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:31,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-07-01 11:39:31,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:31,514 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:31,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,575 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:31,575 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:31,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:39:31,578 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:31,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:39:31,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:39:31,646 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:39:31,648 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:31,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:31,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:31,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:31,648 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:31,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:31,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:31,648 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:31,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-07-01 11:39:31,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:31,649 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:31,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:31,712 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:31,712 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:31,717 INFO L120 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-07-01 11:39:31,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:31,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:31,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:31,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:31,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:31,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:31,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:31,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:31,727 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:39:31,727 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:31,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:31,735 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:39:31,735 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:31,736 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-01 11:39:31,765 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:39:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:31,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:39:31,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:31,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:31,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-01 11:39:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:31,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:31,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:31,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:31,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:31,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:31,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,419 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:32,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:39:32,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:32,687 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-07-01 11:39:32,688 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 8 loop predicates [2020-07-01 11:39:32,688 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-07-01 11:39:32,788 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 34 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 112 states and 136 transitions. Complement of second has 24 states. [2020-07-01 11:39:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-07-01 11:39:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 11:39:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-01 11:39:32,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 6 letters. Loop has 22 letters. [2020-07-01 11:39:32,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:32,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 28 letters. Loop has 22 letters. [2020-07-01 11:39:32,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:32,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 6 letters. Loop has 44 letters. [2020-07-01 11:39:32,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:32,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 136 transitions. [2020-07-01 11:39:32,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:39:32,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions. [2020-07-01 11:39:32,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:39:32,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:39:32,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:39:32,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:39:32,794 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:32,794 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:32,794 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:32,795 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 11:39:32,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:39:32,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:39:32,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:39:32,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:32 BasicIcfg [2020-07-01 11:39:32,802 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:39:32,804 INFO L168 Benchmark]: Toolchain (without parser) took 9390.01 ms. Allocated memory was 649.6 MB in the beginning and 852.5 MB in the end (delta: 202.9 MB). Free memory was 562.8 MB in the beginning and 639.7 MB in the end (delta: -76.9 MB). Peak memory consumption was 126.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,804 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:39:32,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.32 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 562.8 MB in the beginning and 642.1 MB in the end (delta: -79.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.46 ms. Allocated memory is still 678.4 MB. Free memory was 642.1 MB in the beginning and 639.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,805 INFO L168 Benchmark]: Boogie Preprocessor took 18.50 ms. Allocated memory is still 678.4 MB. Free memory was 639.8 MB in the beginning and 638.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,806 INFO L168 Benchmark]: RCFGBuilder took 214.72 ms. Allocated memory is still 678.4 MB. Free memory was 638.8 MB in the beginning and 625.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,807 INFO L168 Benchmark]: BlockEncodingV2 took 69.74 ms. Allocated memory is still 678.4 MB. Free memory was 625.2 MB in the beginning and 619.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,807 INFO L168 Benchmark]: TraceAbstraction took 146.82 ms. Allocated memory is still 678.4 MB. Free memory was 619.8 MB in the beginning and 611.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,808 INFO L168 Benchmark]: BuchiAutomizer took 8606.58 ms. Allocated memory was 678.4 MB in the beginning and 852.5 MB in the end (delta: 174.1 MB). Free memory was 611.0 MB in the beginning and 639.7 MB in the end (delta: -28.7 MB). Peak memory consumption was 145.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:32,810 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 9 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.32 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 562.8 MB in the beginning and 642.1 MB in the end (delta: -79.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.46 ms. Allocated memory is still 678.4 MB. Free memory was 642.1 MB in the beginning and 639.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.50 ms. Allocated memory is still 678.4 MB. Free memory was 639.8 MB in the beginning and 638.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 214.72 ms. Allocated memory is still 678.4 MB. Free memory was 638.8 MB in the beginning and 625.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 69.74 ms. Allocated memory is still 678.4 MB. Free memory was 625.2 MB in the beginning and 619.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 146.82 ms. Allocated memory is still 678.4 MB. Free memory was 619.8 MB in the beginning and 611.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 8606.58 ms. Allocated memory was 678.4 MB in the beginning and 852.5 MB in the end (delta: 174.1 MB). Free memory was 611.0 MB in the beginning and 639.7 MB in the end (delta: -28.7 MB). Peak memory consumption was 145.3 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: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 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 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function c and consists of 25 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 4.4s. Construction of modules took 0.3s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 143 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 214/264 HoareTripleCheckerStatistics: 36 SDtfs, 82 SDslu, 31 SDs, 0 SdLazy, 370 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp97 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 7 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-07-01 11:39:20.170 ----------------------------------------------- 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/BenchExec_run_1IY5TS/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:39:33.443 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check