./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:57:38,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:57:38,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:57:38,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:57:38,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:57:38,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:57:38,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:57:38,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:57:38,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:57:38,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:57:38,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:57:38,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:57:38,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:57:38,396 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:57:38,396 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:57:38,398 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:57:38,398 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:57:38,398 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:57:38,398 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:57:38,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:57:38,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:57:38,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:57:38,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:57:38,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:57:38,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:57:38,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:57:38,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:57:38,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:57:38,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:57:38,403 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:57:38,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:57:38,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:57:38,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:57:38,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:57:38,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:57:38,405 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:57:38,405 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 [2024-10-13 16:57:38,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:57:38,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:57:38,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:57:38,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:57:38,661 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:57:38,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-10-13 16:57:40,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:57:40,266 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:57:40,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-10-13 16:57:40,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886a9e661/f46f2d48ffb848aeb8bd5b5db388bf6b/FLAGcbd78c657 [2024-10-13 16:57:40,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886a9e661/f46f2d48ffb848aeb8bd5b5db388bf6b [2024-10-13 16:57:40,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:57:40,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:57:40,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:40,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:57:40,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:57:40,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e9056d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40, skipping insertion in model container [2024-10-13 16:57:40,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:57:40,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:40,517 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:57:40,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:40,540 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:57:40,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40 WrapperNode [2024-10-13 16:57:40,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:40,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:40,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:57:40,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:57:40,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,563 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2024-10-13 16:57:40,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:40,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:57:40,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:57:40,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:57:40,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,578 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:57:40,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:57:40,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:57:40,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:57:40,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:57:40,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (1/1) ... [2024-10-13 16:57:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:40,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:40,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 16:57:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:57:40,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:57:40,715 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:57:40,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:57:40,771 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-13 16:57:40,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:57:40,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:57:40,781 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:57:40,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:40 BoogieIcfgContainer [2024-10-13 16:57:40,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:57:40,782 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:57:40,782 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:57:40,786 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:57:40,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:40,786 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:57:40" (1/3) ... [2024-10-13 16:57:40,787 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d012970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:40, skipping insertion in model container [2024-10-13 16:57:40,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:40,787 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:40" (2/3) ... [2024-10-13 16:57:40,787 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d012970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:40, skipping insertion in model container [2024-10-13 16:57:40,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:40,787 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:40" (3/3) ... [2024-10-13 16:57:40,789 INFO L332 chiAutomizerObserver]: Analyzing ICFG AlternKonv.c [2024-10-13 16:57:40,831 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:57:40,831 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:57:40,832 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:57:40,832 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:57:40,832 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:57:40,832 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:57:40,832 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:57:40,832 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:57:40,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:40,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:57:40,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:40,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:40,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:40,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:57:40,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:57:40,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:40,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:57:40,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:40,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:40,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:40,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:57:40,865 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 10#L-1true 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; 6#L18-2true [2024-10-13 16:57:40,865 INFO L747 eck$LassoCheckResult]: Loop: 6#L18-2true assume !!(0 != main_~i~0#1); 7#L10true assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 3#L18true assume !(main_~i~0#1 > 0); 6#L18-2true [2024-10-13 16:57:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:57:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272089951] [2024-10-13 16:57:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash 41231, now seen corresponding path program 1 times [2024-10-13 16:57:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185296629] [2024-10-13 16:57:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:40,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash 28700173, now seen corresponding path program 1 times [2024-10-13 16:57:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645485501] [2024-10-13 16:57:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:41,111 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:41,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:41,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:41,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:41,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:41,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:41,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:41,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2024-10-13 16:57:41,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:41,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:41,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,200 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:41,201 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:41,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 16:57:41,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:41,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:41,233 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:41,233 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:41,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 16:57:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 16:57:41,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:41,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:41,274 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:41,274 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 16:57:41,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:41,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:41,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:57:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:41,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:41,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 16:57:41,355 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:41,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 16:57:41,360 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:41,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:41,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:41,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:41,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:41,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:41,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:41,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2024-10-13 16:57:41,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:41,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:41,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:41,414 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:41,418 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 16:57:41,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:41,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:41,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:41,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 16:57:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 16:57:41,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:41,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:41,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:41,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:41,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-13 16:57:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 16:57:41,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:41,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:41,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:41,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:41,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:41,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:41,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:41,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:41,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:41,514 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:57:41,514 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:41,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:41,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:41,535 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:41,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 16:57:41,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:41,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:41,537 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:41,537 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 [] [2024-10-13 16:57:41,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 16:57:41,551 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,575 WARN L253 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:41,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,586 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:41,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:41,660 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:41,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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) [2024-10-13 16:57:41,723 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 24 states and 38 transitions. Complement of second has 6 states. [2024-10-13 16:57:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:41,737 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) [2024-10-13 16:57:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-13 16:57:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-13 16:57:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-13 16:57:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-13 16:57:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:41,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2024-10-13 16:57:41,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:57:41,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 22 transitions. [2024-10-13 16:57:41,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-13 16:57:41,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 16:57:41,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2024-10-13 16:57:41,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2024-10-13 16:57:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2024-10-13 16:57:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-13 16:57:41,796 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) [2024-10-13 16:57:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-10-13 16:57:41,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-13 16:57:41,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-13 16:57:41,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:57:41,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-10-13 16:57:41,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:57:41,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:41,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:41,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:41,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:57:41,799 INFO L745 eck$LassoCheckResult]: Stem: 84#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 85#L-1 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; 86#L18-2 assume !!(0 != main_~i~0#1); 81#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 83#L12 [2024-10-13 16:57:41,803 INFO L747 eck$LassoCheckResult]: Loop: 83#L12 assume !(main_~i~0#1 < 0); 75#L18-2 assume !!(0 != main_~i~0#1); 87#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 83#L12 [2024-10-13 16:57:41,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-13 16:57:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102111463] [2024-10-13 16:57:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:41,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 53210, now seen corresponding path program 1 times [2024-10-13 16:57:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021844875] [2024-10-13 16:57:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:41,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:41,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021844875] [2024-10-13 16:57:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021844875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 16:57:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39173599] [2024-10-13 16:57:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:41,884 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:57:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:57:41,886 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) [2024-10-13 16:57:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:41,900 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2024-10-13 16:57:41,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2024-10-13 16:57:41,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 16:57:41,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2024-10-13 16:57:41,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 16:57:41,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 16:57:41,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2024-10-13 16:57:41,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-13 16:57:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2024-10-13 16:57:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-13 16:57:41,903 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) [2024-10-13 16:57:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2024-10-13 16:57:41,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-13 16:57:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:57:41,904 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-13 16:57:41,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:57:41,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2024-10-13 16:57:41,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 16:57:41,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:41,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:41,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:57:41,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:41,905 INFO L745 eck$LassoCheckResult]: Stem: 122#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 123#L-1 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; 124#L18-2 assume !!(0 != main_~i~0#1); 120#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 121#L12 [2024-10-13 16:57:41,906 INFO L747 eck$LassoCheckResult]: Loop: 121#L12 assume main_~i~0#1 < 0; 116#L13 assume !(main_~i~0#1 <= -2147483648);main_~i~0#1 := -1 * main_~i~0#1; 111#L18-2 assume !!(0 != main_~i~0#1); 125#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 121#L12 [2024-10-13 16:57:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 2 times [2024-10-13 16:57:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071498799] [2024-10-13 16:57:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1451465, now seen corresponding path program 1 times [2024-10-13 16:57:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421140798] [2024-10-13 16:57:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421140798] [2024-10-13 16:57:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421140798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:57:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439391143] [2024-10-13 16:57:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:41,938 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:41,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:41,939 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) [2024-10-13 16:57:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:41,959 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2024-10-13 16:57:41,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2024-10-13 16:57:41,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-13 16:57:41,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2024-10-13 16:57:41,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-13 16:57:41,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-13 16:57:41,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-10-13 16:57:41,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:41,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-13 16:57:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-10-13 16:57:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2024-10-13 16:57:41,962 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) [2024-10-13 16:57:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-10-13 16:57:41,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-13 16:57:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:41,963 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-13 16:57:41,963 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:57:41,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-10-13 16:57:41,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-13 16:57:41,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:41,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:41,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 16:57:41,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2024-10-13 16:57:41,965 INFO L745 eck$LassoCheckResult]: Stem: 165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 166#L-1 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; 167#L18-2 assume !!(0 != main_~i~0#1); 162#L10 [2024-10-13 16:57:41,965 INFO L747 eck$LassoCheckResult]: Loop: 162#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 164#L12 assume !(main_~i~0#1 < 0); 161#L18-2 assume !!(0 != main_~i~0#1); 168#L10 assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 155#L18 assume main_~i~0#1 > 0;main_~i~0#1 := -1 * main_~i~0#1; 157#L18-2 assume !!(0 != main_~i~0#1); 162#L10 [2024-10-13 16:57:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-13 16:57:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510270871] [2024-10-13 16:57:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:41,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1310830888, now seen corresponding path program 1 times [2024-10-13 16:57:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455082515] [2024-10-13 16:57:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455082515] [2024-10-13 16:57:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455082515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:57:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132115425] [2024-10-13 16:57:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:42,029 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:42,030 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) [2024-10-13 16:57:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:42,052 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-10-13 16:57:42,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2024-10-13 16:57:42,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-13 16:57:42,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 31 transitions. [2024-10-13 16:57:42,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-13 16:57:42,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 16:57:42,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2024-10-13 16:57:42,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:42,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-13 16:57:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2024-10-13 16:57:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2024-10-13 16:57:42,055 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) [2024-10-13 16:57:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-10-13 16:57:42,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-13 16:57:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:42,057 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-13 16:57:42,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:57:42,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-10-13 16:57:42,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:42,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:42,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:42,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 16:57:42,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2024-10-13 16:57:42,082 INFO L745 eck$LassoCheckResult]: Stem: 210#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 211#L-1 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; 212#L18-2 assume !!(0 != main_~i~0#1); 208#L10 [2024-10-13 16:57:42,082 INFO L747 eck$LassoCheckResult]: Loop: 208#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 213#L12 assume !(main_~i~0#1 < 0); 214#L18-2 assume !!(0 != main_~i~0#1); 209#L10 assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 204#L18 assume !(main_~i~0#1 > 0); 205#L18-2 assume !!(0 != main_~i~0#1); 208#L10 [2024-10-13 16:57:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 2 times [2024-10-13 16:57:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202838417] [2024-10-13 16:57:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1310830950, now seen corresponding path program 1 times [2024-10-13 16:57:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623319197] [2024-10-13 16:57:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 590073037, now seen corresponding path program 1 times [2024-10-13 16:57:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860751588] [2024-10-13 16:57:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:42,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 16:57:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:42,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:57:42 BoogieIcfgContainer [2024-10-13 16:57:42,297 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:57:42,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:57:42,297 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:57:42,298 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:57:42,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:40" (3/4) ... [2024-10-13 16:57:42,299 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 16:57:42,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:57:42,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:57:42,326 INFO L158 Benchmark]: Toolchain (without parser) took 2034.88ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 98.7MB in the beginning and 206.2MB in the end (delta: -107.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:42,326 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 169.9MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:42,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.77ms. Allocated memory is still 169.9MB. Free memory was 98.4MB in the beginning and 131.4MB in the end (delta: -33.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2024-10-13 16:57:42,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 130.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:42,327 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 128.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:57:42,327 INFO L158 Benchmark]: RCFGBuilder took 195.64ms. Allocated memory is still 169.9MB. Free memory was 128.6MB in the beginning and 118.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:57:42,327 INFO L158 Benchmark]: BuchiAutomizer took 1514.45ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 118.9MB in the beginning and 208.3MB in the end (delta: -89.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:42,328 INFO L158 Benchmark]: Witness Printer took 28.22ms. Allocated memory is still 245.4MB. Free memory was 208.3MB in the beginning and 206.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:57:42,329 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.46ms. Allocated memory is still 169.9MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.77ms. Allocated memory is still 169.9MB. Free memory was 98.4MB in the beginning and 131.4MB in the end (delta: -33.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 169.9MB. Free memory was 131.4MB in the beginning and 130.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 128.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 195.64ms. Allocated memory is still 169.9MB. Free memory was 128.6MB in the beginning and 118.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1514.45ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 118.9MB in the beginning and 208.3MB in the end (delta: -89.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 28.22ms. Allocated memory is still 245.4MB. Free memory was 208.3MB in the beginning and 206.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 4 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 1.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. 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, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 28 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax170 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf96 smp69 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms 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! [2024-10-13 16:57:42,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)