./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/AlternKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/AlternKonv.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:01:53,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:01:53,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:01:53,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:01:53,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:01:53,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:01:53,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:01:53,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:01:53,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:01:53,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:01:53,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:01:53,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:01:53,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:01:53,258 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:01:53,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:01:53,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:01:53,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:01:53,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:01:53,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:01:53,260 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:01:53,260 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 [2025-01-10 07:01:53,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:01:53,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:01:53,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:01:53,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:01:53,484 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:01:53,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2025-01-10 07:01:54,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64a48d2f6/b62c8e657e2a43b2b671f6e50260f90a/FLAG3728167e7 [2025-01-10 07:01:54,800 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:01:54,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2025-01-10 07:01:54,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64a48d2f6/b62c8e657e2a43b2b671f6e50260f90a/FLAG3728167e7 [2025-01-10 07:01:55,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64a48d2f6/b62c8e657e2a43b2b671f6e50260f90a [2025-01-10 07:01:55,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:01:55,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:01:55,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:55,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:01:55,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:01:55,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3756b8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55, skipping insertion in model container [2025-01-10 07:01:55,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:01:55,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:55,261 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:01:55,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:55,280 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:01:55,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55 WrapperNode [2025-01-10 07:01:55,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:55,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:55,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:01:55,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:01:55,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,298 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-01-10 07:01:55,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:55,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:01:55,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:01:55,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:01:55,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,308 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:01:55,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:01:55,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:01:55,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:01:55,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:01:55,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (1/1) ... [2025-01-10 07:01:55,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:01:55,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:01:55,417 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:01:55,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:01:55,469 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:01:55,470 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:01:55,477 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:01:55,478 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:01:55,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:55 BoogieIcfgContainer [2025-01-10 07:01:55,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:01:55,480 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:01:55,480 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:01:55,484 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:01:55,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:55,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:01:55" (1/3) ... [2025-01-10 07:01:55,486 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d26c3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:55, skipping insertion in model container [2025-01-10 07:01:55,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:55,486 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:55" (2/3) ... [2025-01-10 07:01:55,486 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d26c3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:55, skipping insertion in model container [2025-01-10 07:01:55,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:55,486 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:55" (3/3) ... [2025-01-10 07:01:55,487 INFO L363 chiAutomizerObserver]: Analyzing ICFG AlternKonv.c [2025-01-10 07:01:55,529 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:01:55,530 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:01:55,530 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:01:55,530 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:01:55,530 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:01:55,530 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:01:55,530 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:01:55,530 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:01:55,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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) [2025-01-10 07:01:55,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:01:55,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:55,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:55,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:55,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:01:55,549 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:01:55,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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) [2025-01-10 07:01:55,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:01:55,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:55,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:55,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:55,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:01:55,556 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 07:01:55,556 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != main_~i~0#1;" "assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2;" "assume main_~i~0#1 > 0;main_~i~0#1 := -1 * main_~i~0#1;" [2025-01-10 07:01:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:01:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554691926] [2025-01-10 07:01:55,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:55,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:55,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:55,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 36264, now seen corresponding path program 1 times [2025-01-10 07:01:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570833015] [2025-01-10 07:01:55,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:55,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:55,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:55,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:55,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:55,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 28695206, now seen corresponding path program 1 times [2025-01-10 07:01:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446116009] [2025-01-10 07:01:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:55,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:55,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:55,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:01:55,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:01:55,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:55,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:55,712 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:55,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:55,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:55,713 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:55,713 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:01:55,713 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,713 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:55,713 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:55,713 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2025-01-10 07:01:55,713 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:55,713 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:55,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:55,788 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:01:55,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:01:55,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,814 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:55,814 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: [] [2025-01-10 07:01:55,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:01:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:01:55,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,840 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:01:55,841 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: [] [2025-01-10 07:01:55,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:01:55,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:01:55,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:01:55,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:01:55,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:01:55,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:01:55,919 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:01:55,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:55,923 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:01:55,923 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:01:55,923 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:01:55,923 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:01:55,923 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:01:55,923 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,923 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:01:55,923 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:01:55,923 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2025-01-10 07:01:55,923 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:01:55,923 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:01:55,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:01:55,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:01:55,969 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:01:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:55,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:55,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:01:55,976 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 [2025-01-10 07:01:55,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:55,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:55,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:55,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:55,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:01:55,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:01:56,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:56,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:01:56,011 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 [2025-01-10 07:01:56,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:56,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:56,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:56,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:56,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:01:56,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:01:56,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:01:56,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:01:56,042 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 [2025-01-10 07:01:56,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:01:56,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:01:56,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:01:56,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:01:56,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:01:56,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:01:56,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:01:56,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:01:56,058 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:01:56,060 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:01:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,063 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:01:56,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:01:56,066 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:01:56,066 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:01:56,066 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-01-10 07:01:56,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:01:56,074 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:01:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:56,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:56,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:01:56,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:01:56,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,143 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 [2025-01-10 07:01:56,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-10 07:01:56,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 19 states and 30 transitions. Complement of second has 5 states. [2025-01-10 07:01:56,172 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 [2025-01-10 07:01:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-10 07:01:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:01:56,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 07:01:56,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:56,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 07:01:56,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:56,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 07:01:56,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:01:56,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 30 transitions. [2025-01-10 07:01:56,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:01:56,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 22 transitions. [2025-01-10 07:01:56,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:01:56,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:01:56,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2025-01-10 07:01:56,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:56,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-01-10 07:01:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2025-01-10 07:01:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 07:01:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 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) [2025-01-10 07:01:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2025-01-10 07:01:56,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2025-01-10 07:01:56,200 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2025-01-10 07:01:56,200 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:01:56,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2025-01-10 07:01:56,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:01:56,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:56,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:56,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:01:56,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:01:56,201 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~i~0#1;" "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:01:56,201 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 0);" "assume 0 != main_~i~0#1;" "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:01:56,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 07:01:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563807309] [2025-01-10 07:01:56,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:56,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:56,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:56,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:56,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 48245, now seen corresponding path program 1 times [2025-01-10 07:01:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446869799] [2025-01-10 07:01:56,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446869799] [2025-01-10 07:01:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446869799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:56,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:01:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912587348] [2025-01-10 07:01:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:56,236 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:56,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:01:56,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:01:56,241 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2025-01-10 07:01:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:56,258 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2025-01-10 07:01:56,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-01-10 07:01:56,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:01:56,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2025-01-10 07:01:56,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:01:56,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:01:56,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-01-10 07:01:56,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:56,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-01-10 07:01:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-01-10 07:01:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 07:01:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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) [2025-01-10 07:01:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-01-10 07:01:56,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-01-10 07:01:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:01:56,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-01-10 07:01:56,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:01:56,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-01-10 07:01:56,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:01:56,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:56,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:56,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:01:56,261 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:01:56,262 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~i~0#1;" "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:01:56,262 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 0;" "assume !(main_~i~0#1 <= -2147483648);main_~i~0#1 := -1 * main_~i~0#1;" "assume 0 != main_~i~0#1;" "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:01:56,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 2 times [2025-01-10 07:01:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998413946] [2025-01-10 07:01:56,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:56,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:56,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:56,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:56,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:56,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1297545, now seen corresponding path program 1 times [2025-01-10 07:01:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18174318] [2025-01-10 07:01:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:01:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:01:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18174318] [2025-01-10 07:01:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18174318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:01:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025836658] [2025-01-10 07:01:56,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:56,308 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:56,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:01:56,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:01:56,309 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand has 4 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) [2025-01-10 07:01:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:56,328 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-01-10 07:01:56,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2025-01-10 07:01:56,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-01-10 07:01:56,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2025-01-10 07:01:56,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:01:56,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-01-10 07:01:56,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2025-01-10 07:01:56,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:56,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-01-10 07:01:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2025-01-10 07:01:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2025-01-10 07:01:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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) [2025-01-10 07:01:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-01-10 07:01:56,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-01-10 07:01:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:01:56,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-01-10 07:01:56,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:01:56,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-01-10 07:01:56,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 07:01:56,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:56,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:56,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:01:56,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2025-01-10 07:01:56,335 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~i~0#1;" [2025-01-10 07:01:56,335 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 0);" "assume 0 != main_~i~0#1;" "assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2;" "assume main_~i~0#1 > 0;main_~i~0#1 := -1 * main_~i~0#1;" "assume 0 != main_~i~0#1;" [2025-01-10 07:01:56,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:01:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740836675] [2025-01-10 07:01:56,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1162913608, now seen corresponding path program 1 times [2025-01-10 07:01:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142883191] [2025-01-10 07:01:56,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:01:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:56,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142883191] [2025-01-10 07:01:56,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142883191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:56,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:56,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:01:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719366273] [2025-01-10 07:01:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:56,376 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:56,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:01:56,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:01:56,376 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) 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) [2025-01-10 07:01:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:56,402 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-01-10 07:01:56,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2025-01-10 07:01:56,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-01-10 07:01:56,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 31 transitions. [2025-01-10 07:01:56,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-01-10 07:01:56,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-01-10 07:01:56,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2025-01-10 07:01:56,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:01:56,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-01-10 07:01:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2025-01-10 07:01:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2025-01-10 07:01:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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) [2025-01-10 07:01:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-01-10 07:01:56,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-01-10 07:01:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:01:56,406 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-01-10 07:01:56,406 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:01:56,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2025-01-10 07:01:56,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-01-10 07:01:56,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:56,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:56,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:01:56,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2025-01-10 07:01:56,407 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~i~0#1;" [2025-01-10 07:01:56,407 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 0);" "assume 0 != main_~i~0#1;" "assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2;" "assume !(main_~i~0#1 > 0);" "assume 0 != main_~i~0#1;" [2025-01-10 07:01:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2025-01-10 07:01:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345770335] [2025-01-10 07:01:56,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1162913670, now seen corresponding path program 1 times [2025-01-10 07:01:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12188506] [2025-01-10 07:01:56,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:01:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:01:56,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 299604648, now seen corresponding path program 1 times [2025-01-10 07:01:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:56,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836496499] [2025-01-10 07:01:56,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:56,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:01:56,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:01:56,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:01:56,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:01:56,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:56,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:56,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:56,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:56,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:56,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:01:56 BoogieIcfgContainer [2025-01-10 07:01:56,494 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:01:56,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:01:56,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:01:56,495 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:01:56,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:55" (3/4) ... [2025-01-10 07:01:56,497 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:01:56,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:01:56,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:01:56,519 INFO L158 Benchmark]: Toolchain (without parser) took 1370.11ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 68.9MB in the end (delta: 90.5MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-01-10 07:01:56,519 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:01:56,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.12ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 149.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:01:56,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.93ms. Allocated memory is still 201.3MB. Free memory was 149.3MB in the beginning and 148.4MB in the end (delta: 894.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:01:56,520 INFO L158 Benchmark]: Boogie Preprocessor took 17.80ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.5MB in the end (delta: 880.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:01:56,520 INFO L158 Benchmark]: RCFGBuilder took 161.05ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 137.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:01:56,520 INFO L158 Benchmark]: BuchiAutomizer took 1014.46ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 71.6MB in the end (delta: 66.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-10 07:01:56,520 INFO L158 Benchmark]: Witness Printer took 23.85ms. Allocated memory is still 201.3MB. Free memory was 71.6MB in the beginning and 68.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:01:56,524 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.12ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 149.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.93ms. Allocated memory is still 201.3MB. Free memory was 149.3MB in the beginning and 148.4MB in the end (delta: 894.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.80ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.5MB in the end (delta: 880.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 161.05ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 137.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1014.46ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 71.6MB in the end (delta: 66.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 23.85ms. Allocated memory is still 201.3MB. Free memory was 71.6MB in the beginning and 68.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 28 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i != 0 VAL [i=-1] Loop: [L10] COND TRUE i < 0 [L11] i = i+2 [L12] COND FALSE !(i < 0) [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) [L9] COND TRUE i != 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i != 0 VAL [i=-1] Loop: [L10] COND TRUE i < 0 [L11] i = i+2 [L12] COND FALSE !(i < 0) [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) [L9] COND TRUE i != 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:01:56,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:01:56,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)