./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_01.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_01.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 fb88f4e3847928194a09ee7421ca208530ca40554291ef14571bd7868fcf839b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:49:48,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:48,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:48,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:48,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:48,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:48,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:48,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:48,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:48,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:48,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:48,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:48,601 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:48,601 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:48,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:48,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:48,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:48,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:48,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:48,603 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:48,603 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/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 -> fb88f4e3847928194a09ee7421ca208530ca40554291ef14571bd7868fcf839b [2025-03-09 06:49:48,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:48,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:48,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:48,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:48,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:48,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_01.c [2025-03-09 06:49:50,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad2814e6/83941ba135ab4da0bdc6ec5e8f3c27db/FLAGbec602720 [2025-03-09 06:49:50,300 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:50,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_01.c [2025-03-09 06:49:50,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad2814e6/83941ba135ab4da0bdc6ec5e8f3c27db/FLAGbec602720 [2025-03-09 06:49:50,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad2814e6/83941ba135ab4da0bdc6ec5e8f3c27db [2025-03-09 06:49:50,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:50,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:50,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:50,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:50,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:50,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50, skipping insertion in model container [2025-03-09 06:49:50,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:50,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:50,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:50,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:50,781 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:50,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50 WrapperNode [2025-03-09 06:49:50,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:50,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:50,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:50,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:50,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,800 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-03-09 06:49:50,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:50,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:50,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:50,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:50,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,812 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:49:50,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:50,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:50,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:50,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:50,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (1/1) ... [2025-03-09 06:49:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:50,850 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) [2025-03-09 06:49:50,853 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 [2025-03-09 06:49:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:50,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:50,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:50,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:50,998 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:50,998 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:51,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:51,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:51,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:51 BoogieIcfgContainer [2025-03-09 06:49:51,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:51,005 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:51,005 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:51,009 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:51,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:51,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:50" (1/3) ... [2025-03-09 06:49:51,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c930d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:51, skipping insertion in model container [2025-03-09 06:49:51,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:51,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:50" (2/3) ... [2025-03-09 06:49:51,011 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c930d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:51, skipping insertion in model container [2025-03-09 06:49:51,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:51,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:51" (3/3) ... [2025-03-09 06:49:51,012 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_01.c [2025-03-09 06:49:51,059 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:51,059 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:51,059 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:51,059 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:51,059 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:51,059 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:51,059 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:51,060 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:51,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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-03-09 06:49:51,074 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-09 06:49:51,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:51,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:51,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:49:51,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:49:51,079 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:51,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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-03-09 06:49:51,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-09 06:49:51,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:51,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:51,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:49:51,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:49:51,086 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_~c~0#1, main_~i~0#1;havoc main_~c~0#1;havoc main_~i~0#1;main_~c~0#1 := 864;" "assume main_~c~0#1 <= 10;main_~i~0#1 := 0;" [2025-03-09 06:49:51,086 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-09 06:49:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 47621, now seen corresponding path program 1 times [2025-03-09 06:49:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132483626] [2025-03-09 06:49:51,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:51,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:51,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132483626] [2025-03-09 06:49:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132483626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:51,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:51,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:49:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981718127] [2025-03-09 06:49:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:51,213 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 1 times [2025-03-09 06:49:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649897748] [2025-03-09 06:49:51,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:49:51,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:49:51,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:49:51,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:49:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,269 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:51,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:51,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:51,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:51,270 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:51,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:51,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:51,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_01.c_Iteration1_Loop [2025-03-09 06:49:51,270 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:51,270 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:51,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,367 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:51,368 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:51,373 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) [2025-03-09 06:49:51,376 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 [2025-03-09 06:49:51,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:51,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:51,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:51,400 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) [2025-03-09 06:49:51,403 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 [2025-03-09 06:49:51,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:51,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:51,428 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:51,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:49:51,434 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:51,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:51,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:51,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:51,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:51,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:51,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:51,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_01.c_Iteration1_Loop [2025-03-09 06:49:51,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:51,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:51,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:51,479 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:51,482 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:51,487 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) [2025-03-09 06:49:51,488 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 [2025-03-09 06:49:51,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:51,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:51,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:51,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:51,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:51,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:51,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:51,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:51,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:51,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:51,516 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:51,521 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) [2025-03-09 06:49:51,523 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 [2025-03-09 06:49:51,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:51,524 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:51,524 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:51,525 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199 Supporting invariants [] [2025-03-09 06:49:51,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:51,534 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:51,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:51,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:51,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:51,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:51,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:49:51,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:49:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:51,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:51,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:51,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 06:49:51,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:51,631 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 3 states. [2025-03-09 06:49:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2025-03-09 06:49:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 18 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 06:49:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 18 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-09 06:49:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:51,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-09 06:49:51,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:51,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-09 06:49:51,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-09 06:49:51,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 8 states and 11 transitions. [2025-03-09 06:49:51,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:49:51,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:49:51,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-09 06:49:51,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:51,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-09 06:49:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-09 06:49:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-09 06:49:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-09 06:49:51,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-09 06:49:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:51,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:49:51,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:49:51,671 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:51,681 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2025-03-09 06:49:51,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2025-03-09 06:49:51,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 06:49:51,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2025-03-09 06:49:51,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-09 06:49:51,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-09 06:49:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2025-03-09 06:49:51,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:51,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-03-09 06:49:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2025-03-09 06:49:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-03-09 06:49:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 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-03-09 06:49:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-03-09 06:49:51,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-03-09 06:49:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:49:51,687 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-03-09 06:49:51,688 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:51,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2025-03-09 06:49:51,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 06:49:51,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:51,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:51,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:51,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:49:51,688 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_~c~0#1, main_~i~0#1;havoc main_~c~0#1;havoc main_~i~0#1;main_~c~0#1 := 864;" "assume !(main_~c~0#1 <= 10);" "assume !(main_~c~0#1 <= 50);" "assume !(main_~c~0#1 <= 100);main_~i~0#1 := 0;" [2025-03-09 06:49:51,688 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 103;main_~i~0#1 := main_~i~0#1;" [2025-03-09 06:49:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash 45774828, now seen corresponding path program 1 times [2025-03-09 06:49:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189072730] [2025-03-09 06:49:51,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:51,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:51,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 40, now seen corresponding path program 1 times [2025-03-09 06:49:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304151553] [2025-03-09 06:49:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:49:51,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:49:51,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:49:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:49:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1419019677, now seen corresponding path program 1 times [2025-03-09 06:49:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854280314] [2025-03-09 06:49:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:51,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:51,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:51,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:49:51 BoogieIcfgContainer [2025-03-09 06:49:51,779 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:49:51,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:49:51,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:49:51,781 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:49:51,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:51" (3/4) ... [2025-03-09 06:49:51,784 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 06:49:51,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:49:51,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:49:51,810 INFO L158 Benchmark]: Toolchain (without parser) took 1163.43ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 47.7MB in the end (delta: 65.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 06:49:51,810 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:51,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.77ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:51,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.11ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 102.3MB in the end (delta: 499.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:51,810 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 101.3MB in the end (delta: 500.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:51,810 INFO L158 Benchmark]: IcfgBuilder took 185.57ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 91.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:51,811 INFO L158 Benchmark]: BuchiAutomizer took 774.20ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 50.6MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 06:49:51,811 INFO L158 Benchmark]: Witness Printer took 29.12ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 47.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:51,812 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.77ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.11ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 102.3MB in the end (delta: 499.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 101.3MB in the end (delta: 500.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 185.57ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 91.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 774.20ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 50.6MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 29.12ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 47.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 199) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax220 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 41ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 31]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int c; [L7] int i; [L8] c = (24*6)*6 VAL [c=864] [L10] COND FALSE !(c <= 10) VAL [c=864] [L17] COND FALSE !(c <= 50) VAL [c=864] [L23] COND FALSE !(c <= 100) [L30] i = 0 VAL [i=0] Loop: [L31] COND TRUE i < 103 [L32] i = i+0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 31]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int c; [L7] int i; [L8] c = (24*6)*6 VAL [c=864] [L10] COND FALSE !(c <= 10) VAL [c=864] [L17] COND FALSE !(c <= 50) VAL [c=864] [L23] COND FALSE !(c <= 100) [L30] i = 0 VAL [i=0] Loop: [L31] COND TRUE i < 103 [L32] i = i+0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 06:49:51,829 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 [2025-03-09 06:49:52,030 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)