./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:15:40,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:15:40,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:15:40,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:15:40,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:15:40,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:15:40,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:15:40,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:15:40,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:15:40,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:15:40,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:15:40,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:15:40,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:15:40,801 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:15:40,802 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:15:40,804 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:15:40,804 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:15:40,804 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:15:40,804 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:15:40,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:15:40,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:15:40,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:15:40,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:15:40,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:15:40,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:15:40,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:15:40,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:15:40,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:15:40,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:15:40,807 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:15:40,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:15:40,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:15:40,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:15:40,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:15:40,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:15:40,809 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:15:40,809 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2024-11-19 14:15:41,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:15:41,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:15:41,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:15:41,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:15:41,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:15:41,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-19 14:15:42,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:15:42,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:15:42,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-19 14:15:42,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d80deca/b4c14019c282431cb7d06544f139f624/FLAG88455670f [2024-11-19 14:15:42,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d80deca/b4c14019c282431cb7d06544f139f624 [2024-11-19 14:15:42,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:15:42,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:15:42,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:42,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:15:42,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:15:42,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebebc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42, skipping insertion in model container [2024-11-19 14:15:42,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:15:42,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:42,715 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:15:42,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:42,745 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:15:42,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42 WrapperNode [2024-11-19 14:15:42,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:42,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:42,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:15:42,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:15:42,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,770 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-11-19 14:15:42,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:42,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:15:42,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:15:42,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:15:42,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,787 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:15:42,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:15:42,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:15:42,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:15:42,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:15:42,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (1/1) ... [2024-11-19 14:15:42,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:42,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:42,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:15:42,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:15:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:15:42,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:15:42,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:15:43,009 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-19 14:15:43,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:15:43,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:15:43,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:15:43,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:43 BoogieIcfgContainer [2024-11-19 14:15:43,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:15:43,021 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:15:43,022 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:15:43,025 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:15:43,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:43,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:15:42" (1/3) ... [2024-11-19 14:15:43,027 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66b9703e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:43, skipping insertion in model container [2024-11-19 14:15:43,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:43,027 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:42" (2/3) ... [2024-11-19 14:15:43,028 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66b9703e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:43, skipping insertion in model container [2024-11-19 14:15:43,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:43,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:43" (3/3) ... [2024-11-19 14:15:43,029 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2024-11-19 14:15:43,080 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:15:43,080 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:15:43,080 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:15:43,080 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:15:43,080 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:15:43,080 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:15:43,081 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:15:43,081 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:15:43,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:43,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:43,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:43,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:43,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:43,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:43,103 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:15:43,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:43,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:43,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:43,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:43,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:43,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:43,112 INFO L745 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2#L12-2true [2024-11-19 14:15:43,112 INFO L747 eck$LassoCheckResult]: Loop: 2#L12-2true assume !!(main_~i~0#1 < main_~j~0#1); 8#L12true assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2#L12-2true [2024-11-19 14:15:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:15:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:43,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447484452] [2024-11-19 14:15:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:43,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:43,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-11-19 14:15:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866488938] [2024-11-19 14:15:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:43,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:43,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:43,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-11-19 14:15:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:43,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420868763] [2024-11-19 14:15:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420868763] [2024-11-19 14:15:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420868763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:15:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314327590] [2024-11-19 14:15:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:43,451 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:43,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:43,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:43,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:43,452 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:43,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,452 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:43,452 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:43,452 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-19 14:15:43,453 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:43,453 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:43,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:43,577 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:43,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:15:43,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:43,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:43,609 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:43,610 INFO L401 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: [] [2024-11-19 14:15:43,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:43,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:15:43,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:43,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:43,647 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:43,647 INFO L401 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: [] [2024-11-19 14:15:43,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:43,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:15:43,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:43,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:43,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:15:43,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:15:43,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:43,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:43,718 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:43,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:15:43,726 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:43,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:43,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:43,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:43,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:43,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:43,727 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:43,727 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-19 14:15:43,727 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:43,727 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:43,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:43,801 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:43,804 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:15:43,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:43,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:43,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:43,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:43,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:43,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:43,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:43,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:43,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:15:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:15:43,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:43,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:43,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:43,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:43,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:43,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:43,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:43,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:43,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:43,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:15:43,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:43,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:43,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:43,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:43,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:43,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:43,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:43,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:43,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:43,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:43,929 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:43,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:43,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:15:43,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:43,935 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:43,935 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:43,935 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-19 14:15:43,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:43,949 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:43,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:43,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:44,002 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:44,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:44,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,063 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 6 states. [2024-11-19 14:15:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:15:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-19 14:15:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:15:44,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:15:44,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-11-19 14:15:44,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-11-19 14:15:44,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:44,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:44,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-11-19 14:15:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:44,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-19 14:15:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-11-19 14:15:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-19 14:15:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-11-19 14:15:44,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-19 14:15:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:44,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:15:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:15:44,107 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:15:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:44,131 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-11-19 14:15:44,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-11-19 14:15:44,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2024-11-19 14:15:44,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:15:44,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:44,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2024-11-19 14:15:44,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:44,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2024-11-19 14:15:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-19 14:15:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-11-19 14:15:44,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:15:44,138 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:44,138 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:15:44,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-11-19 14:15:44,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:44,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:44,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:15:44,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:44,139 INFO L745 eck$LassoCheckResult]: Stem: 78#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 80#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 81#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 76#L12-2 [2024-11-19 14:15:44,139 INFO L747 eck$LassoCheckResult]: Loop: 76#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 77#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 76#L12-2 [2024-11-19 14:15:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-11-19 14:15:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424498533] [2024-11-19 14:15:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-11-19 14:15:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537475972] [2024-11-19 14:15:44,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,154 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:44,154 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:44,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-11-19 14:15:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64983192] [2024-11-19 14:15:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64983192] [2024-11-19 14:15:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64983192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054343181] [2024-11-19 14:15:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 14:15:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:44,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:15:44,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054343181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 14:15:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466735768] [2024-11-19 14:15:44,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:44,339 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:44,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:44,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:44,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:44,339 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:44,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:44,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:44,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-19 14:15:44,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:44,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:44,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,397 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:44,399 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:15:44,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:44,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:44,422 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:44,422 INFO L401 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: [] [2024-11-19 14:15:44,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:44,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,436 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:15:44,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:44,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:44,458 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:44,458 INFO L401 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: [] [2024-11-19 14:15:44,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:15:44,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:44,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:44,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:15:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,496 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:15:44,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:44,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:44,533 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:44,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:44,537 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:44,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:44,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:44,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:44,538 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:44,538 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,538 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:44,538 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:44,538 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-19 14:15:44,538 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:44,538 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:44,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:44,592 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:44,592 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:44,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,594 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:15:44,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:44,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:44,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:44,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:44,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:44,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:44,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:44,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:44,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:44,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,630 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:15:44,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:44,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:44,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:44,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:44,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:44,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:44,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:44,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:44,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:15:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:15:44,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:44,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:44,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:44,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:44,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:44,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:44,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:44,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:44,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:44,688 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:44,688 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:44,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:15:44,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:44,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:44,695 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:44,695 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-19 14:15:44,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:44,721 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:44,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:44,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:44,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:44,759 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:44,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:44,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,775 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 13 transitions. Complement of second has 5 states. [2024-11-19 14:15:44,775 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 [2024-11-19 14:15:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:15:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:15:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:15:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:44,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2024-11-19 14:15:44,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2024-11-19 14:15:44,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:15:44,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:15:44,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-11-19 14:15:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:44,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-19 14:15:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-11-19 14:15:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-19 14:15:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-19 14:15:44,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-19 14:15:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:15:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:15:44,780 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:44,795 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-19 14:15:44,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-19 14:15:44,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-19 14:15:44,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:15:44,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:15:44,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-19 14:15:44,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:44,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-19 14:15:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-19 14:15:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-19 14:15:44,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:15:44,799 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:44,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:15:44,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-19 14:15:44,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:44,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:44,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2024-11-19 14:15:44,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:44,801 INFO L745 eck$LassoCheckResult]: Stem: 188#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 190#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 191#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 186#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 187#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 197#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 196#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 195#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 194#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 193#L12-2 [2024-11-19 14:15:44,801 INFO L747 eck$LassoCheckResult]: Loop: 193#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 192#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 193#L12-2 [2024-11-19 14:15:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2024-11-19 14:15:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110538546] [2024-11-19 14:15:44,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:44,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:44,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-11-19 14:15:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537542253] [2024-11-19 14:15:44,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,822 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:15:44,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:44,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2024-11-19 14:15:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470305046] [2024-11-19 14:15:44,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,834 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:44,834 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470305046] [2024-11-19 14:15:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470305046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704145953] [2024-11-19 14:15:44,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:44,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,925 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 14:15:44,952 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:44,952 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:44,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:44,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:44,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704145953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:45,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 14:15:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301206453] [2024-11-19 14:15:45,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:45,053 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:45,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-19 14:15:45,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,116 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,116 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:45,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,118 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:15:45,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,140 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:45,141 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:45,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:15:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,153 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:15:45,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,180 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:15:45,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:45,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,212 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:45,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,217 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:45,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-19 14:15:45,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,280 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,280 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:45,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,282 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:15:45,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:45,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:45,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:45,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:45,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,313 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:15:45,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:45,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:45,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:45,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:45,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:45,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:45,334 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:45,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,336 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:15:45,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:45,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:45,338 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:45,338 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-19 14:15:45,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,350 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:45,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,397 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,400 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:45,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-19 14:15:45,406 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 [2024-11-19 14:15:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:45,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:45,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,407 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,436 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,439 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:45,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-19 14:15:45,447 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 [2024-11-19 14:15:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:45,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:45,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,449 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:45,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 14:15:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,529 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,533 INFO L141 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 [2024-11-19 14:15:45,533 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2024-11-19 14:15:45,543 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 [2024-11-19 14:15:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-19 14:15:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-19 14:15:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:15:45,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-19 14:15:45,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:45,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-11-19 14:15:45,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:15:45,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:15:45,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-19 14:15:45,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:45,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-19 14:15:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-19 14:15:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-19 14:15:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-19 14:15:45,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-19 14:15:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:15:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:15:45,549 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:45,588 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-19 14:15:45,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-11-19 14:15:45,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:45,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2024-11-19 14:15:45,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:15:45,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:15:45,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-19 14:15:45,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:45,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:15:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-19 14:15:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-19 14:15:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-19 14:15:45,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-19 14:15:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:15:45,600 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-19 14:15:45,600 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:15:45,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-11-19 14:15:45,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:45,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:45,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:45,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2024-11-19 14:15:45,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:45,602 INFO L745 eck$LassoCheckResult]: Stem: 501#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 503#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 504#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 496#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 497#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 520#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 519#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 518#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 517#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 516#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 515#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 514#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 513#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 512#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 511#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 510#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 509#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 508#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 507#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 506#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 500#L12 [2024-11-19 14:15:45,602 INFO L747 eck$LassoCheckResult]: Loop: 500#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 505#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 500#L12 [2024-11-19 14:15:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2024-11-19 14:15:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055865675] [2024-11-19 14:15:45,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-19 14:15:45,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:45,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-11-19 14:15:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314824525] [2024-11-19 14:15:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:45,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2024-11-19 14:15:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166873639] [2024-11-19 14:15:45,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,673 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:45,673 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:45,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:45,720 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,721 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:45,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-19 14:15:45,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,721 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,767 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,767 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,769 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:15:45,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,797 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:15:45,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:45,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,827 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:45,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,832 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:45,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-19 14:15:45,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,832 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,883 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,883 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:45,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,885 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:15:45,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:45,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:45,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:45,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:45,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:45,905 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:45,905 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:45,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,909 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:15:45,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:45,910 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:45,910 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:45,910 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-19 14:15:45,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:15:45,924 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:45,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,989 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:46,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-19 14:15:46,016 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 [2024-11-19 14:15:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:46,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-19 14:15:46,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-19 14:15:46,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-19 14:15:46,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-19 14:15:46,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:46,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2024-11-19 14:15:46,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:15:46,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:46,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-11-19 14:15:46,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:46,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-19 14:15:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-11-19 14:15:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-19 14:15:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-19 14:15:46,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-19 14:15:46,021 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-19 14:15:46,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:15:46,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-11-19 14:15:46,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:46,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:46,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:46,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-11-19 14:15:46,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:46,022 INFO L745 eck$LassoCheckResult]: Stem: 652#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 648#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 649#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 654#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 655#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 650#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 651#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 674#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 673#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 672#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 671#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 670#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 669#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 668#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 667#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 666#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 665#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 664#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 663#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 662#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 661#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 660#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 657#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 656#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 658#L12 [2024-11-19 14:15:46,022 INFO L747 eck$LassoCheckResult]: Loop: 658#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 659#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 658#L12 [2024-11-19 14:15:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2024-11-19 14:15:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813923469] [2024-11-19 14:15:46,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:46,038 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:15:46,038 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813923469] [2024-11-19 14:15:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813923469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87204358] [2024-11-19 14:15:46,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,207 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-19 14:15:46,236 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:15:46,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:46,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87204358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:46,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-19 14:15:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305206732] [2024-11-19 14:15:46,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:46,456 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:46,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-11-19 14:15:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942445573] [2024-11-19 14:15:46,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:46,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:46,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:46,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:46,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:46,482 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,482 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,482 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,482 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:46,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-11-19 14:15:46,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,522 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,522 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:46,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,523 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:15:46,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:15:46,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,549 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:15:46,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:46,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,578 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:46,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,581 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,582 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,582 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:46,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-11-19 14:15:46,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,582 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,619 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,619 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:46,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,620 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:15:46,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:46,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:46,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:46,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:46,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:46,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:46,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:46,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:46,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:46,636 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:46,636 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,638 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:15:46,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:46,640 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:46,641 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:46,641 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-19 14:15:46,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,713 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,728 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:46,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-19 14:15:46,739 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 [2024-11-19 14:15:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:46,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:46,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,740 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,789 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,800 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:46,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 43 transitions. Complement of second has 5 states. [2024-11-19 14:15:46,812 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 [2024-11-19 14:15:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:46,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:46,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,812 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,907 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,919 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:46,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 45 transitions. Complement of second has 4 states. [2024-11-19 14:15:46,927 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 [2024-11-19 14:15:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-19 14:15:46,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:46,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-19 14:15:46,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-19 14:15:46,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-19 14:15:46,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:15:46,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2024-11-19 14:15:46,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:46,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:46,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-19 14:15:46,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:46,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-19 14:15:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-19 14:15:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-19 14:15:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-19 14:15:46,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:15:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:15:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:15:46,937 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:47,013 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-19 14:15:47,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2024-11-19 14:15:47,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:47,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2024-11-19 14:15:47,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:47,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:47,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2024-11-19 14:15:47,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:47,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-19 14:15:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2024-11-19 14:15:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-19 14:15:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-19 14:15:47,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-19 14:15:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 14:15:47,018 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-19 14:15:47,018 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:15:47,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2024-11-19 14:15:47,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:47,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:47,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:47,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2024-11-19 14:15:47,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:47,023 INFO L745 eck$LassoCheckResult]: Stem: 1321#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1317#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1318#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1323#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1324#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1319#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1320#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1366#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1365#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1364#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1363#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1362#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1361#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1360#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1359#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1358#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1357#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1356#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1355#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1354#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1353#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1352#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1351#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1350#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1349#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1348#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1347#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1346#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1345#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1342#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1341#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1340#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1339#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1338#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1337#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1336#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1335#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1334#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1333#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1332#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1331#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1330#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1329#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1328#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1326#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1325#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1327#L12 [2024-11-19 14:15:47,023 INFO L747 eck$LassoCheckResult]: Loop: 1327#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1328#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1326#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1325#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1327#L12 [2024-11-19 14:15:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2024-11-19 14:15:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881706966] [2024-11-19 14:15:47,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:47,047 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:47,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881706966] [2024-11-19 14:15:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881706966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530471243] [2024-11-19 14:15:47,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:47,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:47,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,448 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-19 14:15:47,488 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:47,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:47,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530471243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:48,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:48,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-19 14:15:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126544636] [2024-11-19 14:15:48,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:48,170 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-11-19 14:15:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728434341] [2024-11-19 14:15:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:48,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:48,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-19 14:15:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 14:15:48,209 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:48,326 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-19 14:15:48,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2024-11-19 14:15:48,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:48,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2024-11-19 14:15:48,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:48,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:48,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2024-11-19 14:15:48,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:48,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-11-19 14:15:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2024-11-19 14:15:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-19 14:15:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-11-19 14:15:48,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-19 14:15:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-19 14:15:48,333 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-19 14:15:48,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:15:48,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2024-11-19 14:15:48,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:48,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:48,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:48,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2024-11-19 14:15:48,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:48,336 INFO L745 eck$LassoCheckResult]: Stem: 1833#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1829#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1830#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1835#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1836#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1831#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1832#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1926#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1925#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1924#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1923#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1922#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1921#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1920#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1919#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1918#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1917#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1916#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1915#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1914#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1913#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1912#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1911#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1910#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1909#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1908#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1907#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1906#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1905#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1904#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1903#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1902#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1901#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1900#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1899#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1898#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1897#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1896#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1895#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1894#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1893#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1892#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1891#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1890#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1889#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1888#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1887#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1886#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1885#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1884#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1883#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1882#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1881#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1880#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1879#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1878#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1877#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1876#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1875#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1874#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1873#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1872#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1871#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1870#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1869#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1868#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1867#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1866#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1865#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1864#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1863#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1862#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1861#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1860#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1859#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1858#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1857#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1854#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1853#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1852#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1851#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1850#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1849#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1848#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1847#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1846#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1845#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1844#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1843#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1842#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1841#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1840#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1838#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1837#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1839#L12 [2024-11-19 14:15:48,337 INFO L747 eck$LassoCheckResult]: Loop: 1839#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1840#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1838#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1837#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1839#L12 [2024-11-19 14:15:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2024-11-19 14:15:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210689268] [2024-11-19 14:15:48,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:48,386 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-19 14:15:48,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210689268] [2024-11-19 14:15:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210689268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723632514] [2024-11-19 14:15:49,628 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:49,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:49,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:49,631 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-19 14:15:49,715 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-19 14:15:49,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:49,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 14:15:49,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:49,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723632514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:50,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2024-11-19 14:15:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810913608] [2024-11-19 14:15:50,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:50,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:50,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-11-19 14:15:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435500461] [2024-11-19 14:15:50,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:50,930 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:50,930 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:50,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:50,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-19 14:15:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 14:15:50,976 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:51,089 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-11-19 14:15:51,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2024-11-19 14:15:51,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:51,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2024-11-19 14:15:51,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:51,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:51,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2024-11-19 14:15:51,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:51,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-11-19 14:15:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2024-11-19 14:15:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 14:15:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2024-11-19 14:15:51,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-19 14:15:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-19 14:15:51,095 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-19 14:15:51,095 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:15:51,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2024-11-19 14:15:51,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:51,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:51,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:51,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2024-11-19 14:15:51,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:51,099 INFO L745 eck$LassoCheckResult]: Stem: 2669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2670#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2665#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2666#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2671#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2672#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2667#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2668#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2768#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2767#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2766#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2765#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2764#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2763#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2762#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2761#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2760#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2759#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2758#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2757#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2756#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2755#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2754#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2753#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2752#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2751#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2750#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2749#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2748#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2747#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2746#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2745#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2744#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2743#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2742#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2741#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2740#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2739#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2738#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2737#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2736#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2735#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2734#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2733#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2732#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2731#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2730#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2729#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2728#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2727#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2726#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2725#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2724#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2723#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2722#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2721#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2720#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2719#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2718#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2717#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2716#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2715#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2714#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2713#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2712#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2711#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2710#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2709#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2708#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2707#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2706#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2705#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2704#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2703#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2702#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2701#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2700#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2699#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2698#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2697#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2696#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2695#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2694#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2693#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2690#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2689#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2688#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2687#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2686#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2685#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2684#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2683#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2682#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2681#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2680#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2679#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2678#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2677#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2676#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2674#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2675#L12 [2024-11-19 14:15:51,099 INFO L747 eck$LassoCheckResult]: Loop: 2675#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2676#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2674#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2675#L12 [2024-11-19 14:15:51,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2024-11-19 14:15:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78632455] [2024-11-19 14:15:51,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:51,132 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2024-11-19 14:15:51,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:51,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:51,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-11-19 14:15:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386500224] [2024-11-19 14:15:51,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:51,174 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:15:51,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:51,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:51,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2024-11-19 14:15:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042032159] [2024-11-19 14:15:51,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:51,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:51,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:15:53 BoogieIcfgContainer [2024-11-19 14:15:53,877 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:15:53,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:15:53,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:15:53,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:15:53,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:43" (3/4) ... [2024-11-19 14:15:53,881 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:15:53,921 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:15:53,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:15:53,922 INFO L158 Benchmark]: Toolchain (without parser) took 11416.88ms. Allocated memory was 125.8MB in the beginning and 302.0MB in the end (delta: 176.2MB). Free memory was 57.3MB in the beginning and 234.9MB in the end (delta: -177.6MB). Peak memory consumption was 118.3kB. Max. memory is 16.1GB. [2024-11-19 14:15:53,922 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:53,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.59ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 143.5MB in the end (delta: -86.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-19 14:15:53,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.50ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:15:53,922 INFO L158 Benchmark]: Boogie Preprocessor took 22.22ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 141.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:53,923 INFO L158 Benchmark]: RCFGBuilder took 226.37ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 132.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 14:15:53,923 INFO L158 Benchmark]: BuchiAutomizer took 10855.19ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 132.0MB in the beginning and 240.1MB in the end (delta: -108.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-19 14:15:53,923 INFO L158 Benchmark]: Witness Printer took 44.01ms. Allocated memory is still 302.0MB. Free memory was 240.1MB in the beginning and 234.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:15:53,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.59ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 143.5MB in the end (delta: -86.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.50ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.22ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 141.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 226.37ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 132.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10855.19ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 132.0MB in the beginning and 240.1MB in the end (delta: -108.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 44.01ms. Allocated memory is still 302.0MB. Free memory was 240.1MB in the beginning and 234.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 9.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 51 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:15:53,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:54,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:54,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-19 14:15:54,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:54,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:54,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)