./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_03.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/NO_03.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 57953bf177b77bdcba210d5dce369395d242a617ef951a05d4a0af10ca288ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:02:21,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:02:21,447 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:02:21,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:02:21,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:02:21,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:02:21,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:02:21,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:02:21,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:02:21,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:02:21,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:02:21,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:02:21,466 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:02:21,466 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:02:21,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:02:21,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:02:21,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:02:21,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:02:21,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:02:21,469 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:02:21,469 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 -> 57953bf177b77bdcba210d5dce369395d242a617ef951a05d4a0af10ca288ca4 [2025-01-10 07:02:21,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:02:21,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:02:21,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:02:21,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:02:21,680 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:02:21,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_03.c [2025-01-10 07:02:23,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c05d91d/9a0159c84c384c538fafc7e5ec440ece/FLAG8dbf32da1 [2025-01-10 07:02:23,277 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:02:23,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_03.c [2025-01-10 07:02:23,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c05d91d/9a0159c84c384c538fafc7e5ec440ece/FLAG8dbf32da1 [2025-01-10 07:02:23,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c05d91d/9a0159c84c384c538fafc7e5ec440ece [2025-01-10 07:02:23,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:02:23,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:02:23,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:23,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:02:23,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:02:23,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e661a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23, skipping insertion in model container [2025-01-10 07:02:23,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:02:23,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:23,679 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:02:23,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:23,699 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:02:23,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23 WrapperNode [2025-01-10 07:02:23,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:23,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:23,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:02:23,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:02:23,707 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:02:23" (1/1) ... [2025-01-10 07:02:23,709 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:02:23" (1/1) ... [2025-01-10 07:02:23,726 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-01-10 07:02:23,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:23,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:02:23,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:02:23,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:02:23,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,749 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:02:23,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:02:23,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:02:23,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:02:23,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:02:23,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (1/1) ... [2025-01-10 07:02:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,802 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:02:23,811 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:02:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:02:23,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:02:23,931 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:02:23,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:02:23,996 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:02:23,996 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:02:24,002 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:02:24,005 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:02:24,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:24 BoogieIcfgContainer [2025-01-10 07:02:24,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:02:24,007 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:02:24,007 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:02:24,012 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:02:24,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:24,013 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:02:23" (1/3) ... [2025-01-10 07:02:24,014 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c04ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:24, skipping insertion in model container [2025-01-10 07:02:24,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:24,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:23" (2/3) ... [2025-01-10 07:02:24,016 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c04ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:24, skipping insertion in model container [2025-01-10 07:02:24,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:24,016 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:24" (3/3) ... [2025-01-10 07:02:24,017 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_03.c [2025-01-10 07:02:24,060 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:02:24,061 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:02:24,061 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:02:24,061 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:02:24,061 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:02:24,062 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:02:24,062 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:02:24,062 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:02:24,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:24,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:24,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:24,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:24,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:24,080 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:02:24,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:24,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:24,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:24,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:24,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:24,087 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_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-01-10 07:02:24,087 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 1);main_~i~0#1 := main_~i~0#1;" [2025-01-10 07:02:24,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:02:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557235185] [2025-01-10 07:02:24,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1159, now seen corresponding path program 1 times [2025-01-10 07:02:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492133678] [2025-01-10 07:02:24,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,239 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:02:24,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:24,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492133678] [2025-01-10 07:02:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492133678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:02:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:02:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081813783] [2025-01-10 07:02:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:24,244 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:02:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:24,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:02:24,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:02:24,283 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:02:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:24,308 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-01-10 07:02:24,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-01-10 07:02:24,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:02:24,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 5 states and 6 transitions. [2025-01-10 07:02:24,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:24,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:02:24,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-01-10 07:02:24,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:02:24,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:02:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-01-10 07:02:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-01-10 07:02:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:02:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-01-10 07:02:24,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:02:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:02:24,335 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:02:24,335 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:02:24,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-01-10 07:02:24,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:02:24,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:24,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:24,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:24,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:02:24,336 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_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-01-10 07:02:24,337 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~j~0#1 := 0;" "assume main_~j~0#1 < 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 < 1);main_~i~0#1 := main_~i~0#1;" [2025-01-10 07:02:24,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:02:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114375576] [2025-01-10 07:02:24,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:24,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 35879, now seen corresponding path program 1 times [2025-01-10 07:02:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657867942] [2025-01-10 07:02:24,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:24,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:02:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:02:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash 28694821, now seen corresponding path program 1 times [2025-01-10 07:02:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665805490] [2025-01-10 07:02:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:24,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:24,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:24,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:24,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:24,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:02:24 BoogieIcfgContainer [2025-01-10 07:02:24,510 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:02:24,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:02:24,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:02:24,510 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:02:24,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:24" (3/4) ... [2025-01-10 07:02:24,512 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:02:24,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:02:24,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:02:24,544 INFO L158 Benchmark]: Toolchain (without parser) took 969.69ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 66.9MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 07:02:24,544 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:24,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.51ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 102.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:24,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.74ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 948.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:24,545 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 983.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:24,545 INFO L158 Benchmark]: RCFGBuilder took 243.23ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 91.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:24,545 INFO L158 Benchmark]: BuchiAutomizer took 503.05ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 69.7MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:02:24,546 INFO L158 Benchmark]: Witness Printer took 33.74ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:24,550 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.51ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 102.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.74ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 948.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 983.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 243.23ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 91.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 503.05ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 69.7MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 33.74ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). There was no memory consumed. 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 7 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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] int j; [L8] i = 0 VAL [i=0] Loop: [L10] COND TRUE i < 100 [L11] j = 0 [L12] COND TRUE j < 1 [L13] j = j+1 [L12] COND FALSE !(j < 1) [L15] i = 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] int j; [L8] i = 0 VAL [i=0] Loop: [L10] COND TRUE i < 100 [L11] j = 0 [L12] COND TRUE j < 1 [L13] j = j+1 [L12] COND FALSE !(j < 1) [L15] i = i+0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:02:24,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)