./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:04:40,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:04:40,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:04:40,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:04:40,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:04:40,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:04:40,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:04:40,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:04:40,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:04:40,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:04:40,603 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:04:40,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:04:40,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:04:40,603 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:04:40,604 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:04:40,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:04:40,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:04:40,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:04:40,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:04:40,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:04:40,606 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:04:40,606 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2025-03-04 16:04:40,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:04:40,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:04:40,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:04:40,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:04:40,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:04:40,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2025-03-04 16:04:41,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1a04ac5/e2af938f6fd843be9627a35544c0a813/FLAG491decdea [2025-03-04 16:04:42,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:04:42,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2025-03-04 16:04:42,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1a04ac5/e2af938f6fd843be9627a35544c0a813/FLAG491decdea [2025-03-04 16:04:42,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1a04ac5/e2af938f6fd843be9627a35544c0a813 [2025-03-04 16:04:42,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:04:42,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:04:42,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:42,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:04:42,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:04:42,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcaba70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42, skipping insertion in model container [2025-03-04 16:04:42,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:04:42,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:42,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:04:42,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:42,656 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:04:42,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42 WrapperNode [2025-03-04 16:04:42,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:42,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:42,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:04:42,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:04:42,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,674 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 45 [2025-03-04 16:04:42,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:42,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:04:42,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:04:42,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:04:42,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,687 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 16:04:42,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:04:42,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:04:42,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:04:42,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:04:42,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (1/1) ... [2025-03-04 16:04:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:42,723 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-04 16:04:42,727 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-04 16:04:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:04:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:04:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:04:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:04:42,786 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:04:42,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:04:42,852 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 16:04:42,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:04:42,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:04:42,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:04:42,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:42 BoogieIcfgContainer [2025-03-04 16:04:42,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:04:42,858 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:04:42,858 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:04:42,862 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:04:42,862 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:42,862 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:04:42" (1/3) ... [2025-03-04 16:04:42,863 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627940a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:42, skipping insertion in model container [2025-03-04 16:04:42,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:42,863 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:42" (2/3) ... [2025-03-04 16:04:42,863 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627940a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:42, skipping insertion in model container [2025-03-04 16:04:42,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:42,863 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:42" (3/3) ... [2025-03-04 16:04:42,864 INFO L363 chiAutomizerObserver]: Analyzing ICFG id_build.i [2025-03-04 16:04:42,902 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:04:42,902 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:04:42,902 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:04:42,902 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:04:42,902 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:04:42,903 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:04:42,903 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:04:42,903 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:04:42,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-04 16:04:42,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 16:04:42,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:42,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:42,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:42,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:42,924 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:04:42,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-04 16:04:42,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 16:04:42,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:42,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:42,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:42,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:42,931 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-03-04 16:04:42,931 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 8);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2025-03-04 16:04:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1696, now seen corresponding path program 1 times [2025-03-04 16:04:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361940298] [2025-03-04 16:04:42,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:42,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:42,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:42,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:42,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:42,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:43,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1615, now seen corresponding path program 1 times [2025-03-04 16:04:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072774482] [2025-03-04 16:04:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:43,077 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-04 16:04:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072774482] [2025-03-04 16:04:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072774482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:04:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:04:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 16:04:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784917688] [2025-03-04 16:04:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:04:43,084 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:04:43,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:43,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:04:43,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:04:43,104 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-03-04 16:04:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:43,127 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-04 16:04:43,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2025-03-04 16:04:43,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 16:04:43,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 13 states and 14 transitions. [2025-03-04 16:04:43,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 16:04:43,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 16:04:43,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2025-03-04 16:04:43,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:43,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-04 16:04:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2025-03-04 16:04:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2025-03-04 16:04:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-04 16:04:43,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-04 16:04:43,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:04:43,161 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-04 16:04:43,161 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:04:43,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-03-04 16:04:43,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:04:43,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:43,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:43,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:43,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:43,162 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-03-04 16:04:43,163 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 8);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2025-03-04 16:04:43,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1696, now seen corresponding path program 2 times [2025-03-04 16:04:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266105636] [2025-03-04 16:04:43,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:04:43,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -503950735, now seen corresponding path program 1 times [2025-03-04 16:04:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800709418] [2025-03-04 16:04:43,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:43,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800709418] [2025-03-04 16:04:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800709418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:04:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288622141] [2025-03-04 16:04:43,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:04:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:43,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:04:43,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:04:43,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:43,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:43,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:43,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:04:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:04:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288622141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:04:43,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:04:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 16:04:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469645525] [2025-03-04 16:04:43,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:04:43,336 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:04:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:04:43,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:04:43,337 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:43,367 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-04 16:04:43,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2025-03-04 16:04:43,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 16:04:43,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2025-03-04 16:04:43,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:04:43,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:04:43,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2025-03-04 16:04:43,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:43,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 16:04:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2025-03-04 16:04:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 16:04:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 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-04 16:04:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-04 16:04:43,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 16:04:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:04:43,380 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 16:04:43,380 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:04:43,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2025-03-04 16:04:43,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 16:04:43,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:43,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:43,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:43,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1] [2025-03-04 16:04:43,381 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-03-04 16:04:43,381 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 8);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2025-03-04 16:04:43,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1696, now seen corresponding path program 3 times [2025-03-04 16:04:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270557279] [2025-03-04 16:04:43,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:04:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:04:43,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:43,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1015218383, now seen corresponding path program 2 times [2025-03-04 16:04:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332064099] [2025-03-04 16:04:43,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 16:04:43,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:04:43,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:04:43,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332064099] [2025-03-04 16:04:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332064099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:04:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777576954] [2025-03-04 16:04:43,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:43,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:04:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:43,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:04:43,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 16:04:43,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 16:04:43,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:04:43,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:04:43,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:43,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:04:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:04:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777576954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:04:43,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:04:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 16:04:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007369177] [2025-03-04 16:04:43,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:04:43,726 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:04:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:43,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:04:43,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:04:43,726 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. cyclomatic complexity: 2 Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-04 16:04:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:43,758 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-03-04 16:04:43,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2025-03-04 16:04:43,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-03-04 16:04:43,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 45 transitions. [2025-03-04 16:04:43,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-03-04 16:04:43,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-04 16:04:43,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 45 transitions. [2025-03-04 16:04:43,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:43,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-03-04 16:04:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 45 transitions. [2025-03-04 16:04:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 16:04:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 43 states have internal predecessors, (45), 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-04 16:04:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-03-04 16:04:43,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-03-04 16:04:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:04:43,762 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-03-04 16:04:43,762 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:04:43,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 45 transitions. [2025-03-04 16:04:43,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-03-04 16:04:43,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:43,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:43,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:43,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1] [2025-03-04 16:04:43,763 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-03-04 16:04:43,763 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 8);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2025-03-04 16:04:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1696, now seen corresponding path program 4 times [2025-03-04 16:04:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429555859] [2025-03-04 16:04:43,766 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:04:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 16:04:43,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:04:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:43,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:43,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -801129649, now seen corresponding path program 3 times [2025-03-04 16:04:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063046118] [2025-03-04 16:04:43,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:04:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-03-04 16:04:43,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 16:04:43,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 16:04:43,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 16:04:43,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 16:04:43,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1132721362, now seen corresponding path program 1 times [2025-03-04 16:04:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112198277] [2025-03-04 16:04:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:43,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 16:04:43,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 16:04:43,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 16:04:43,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 16:04:43,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:43,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:43,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:44,370 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:44,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:44,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:44,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:44,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:44,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:44,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:44,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2025-03-04 16:04:44,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:44,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:44,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,435 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:44,435 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,444 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-04 16:04:44,446 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-04 16:04:44,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:44,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:44,462 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:44,462 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:44,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 16:04:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,471 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-04 16:04:44,472 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-04 16:04:44,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:44,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:44,487 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:44,487 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:44,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:44,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 16:04:44,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:44,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:44,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:04:44,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:44,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:44,561 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:44,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:44,566 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:44,566 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:44,566 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:44,566 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:44,566 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:44,566 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,566 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:44,566 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:44,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2025-03-04 16:04:44,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:44,566 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:44,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:44,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:44,625 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:04:44,631 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-04 16:04:44,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:44,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:44,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:44,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:44,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:44,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:44,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:44,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:44,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:04:44,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:04:44,661 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-04 16:04:44,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:44,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:44,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:44,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:44,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:44,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:44,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:44,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:44,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:04:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,683 INFO L229 MonitoredProcess]: Starting monitored process 10 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-04 16:04:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:04:44,687 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-04 16:04:44,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:44,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:44,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:44,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:44,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:44,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:44,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:44,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:44,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:04:44,711 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-04 16:04:44,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:44,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:44,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:44,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:44,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:44,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:44,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:44,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:44,730 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:04:44,732 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:44,737 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:44,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:04:44,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:44,740 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:44,740 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:44,740 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nlen~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 16:04:44,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:44,749 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:44,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:44,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:44,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:44,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:44,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 16:04:44,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 16:04:44,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:44,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:44,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:44,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 16:04:44,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:04:44,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 45 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04 16:04:45,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 45 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 86 states and 89 transitions. Complement of second has 4 states. [2025-03-04 16:04:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04 16:04:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 16:04:45,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 42 letters. [2025-03-04 16:04:45,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 44 letters. Loop has 42 letters. [2025-03-04 16:04:45,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 84 letters. [2025-03-04 16:04:45,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 89 transitions. [2025-03-04 16:04:45,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:04:45,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 16:04:45,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-03-04 16:04:45,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-04 16:04:45,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 89 transitions. [2025-03-04 16:04:45,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:45,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 16:04:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 89 transitions. [2025-03-04 16:04:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2025-03-04 16:04:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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-04 16:04:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-03-04 16:04:45,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-04 16:04:45,038 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-04 16:04:45,038 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:04:45,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2025-03-04 16:04:45,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:04:45,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:45,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:45,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:04:45,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:04:45,039 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" [2025-03-04 16:04:45,039 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-03-04 16:04:45,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash 52597, now seen corresponding path program 1 times [2025-03-04 16:04:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030309544] [2025-03-04 16:04:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:45,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:45,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:45,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 47677477, now seen corresponding path program 1 times [2025-03-04 16:04:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080210711] [2025-03-04 16:04:45,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1707017423, now seen corresponding path program 1 times [2025-03-04 16:04:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98399863] [2025-03-04 16:04:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:04:45,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:04:45,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:04:45,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:04:45,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,110 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:45,110 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:45,110 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:45,110 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:45,110 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:45,110 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,110 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:45,110 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:45,110 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2025-03-04 16:04:45,110 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:45,110 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:45,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:45,171 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:45,171 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,173 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:04:45,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:45,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,186 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:45,186 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:45,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 16:04:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,194 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:04:45,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:45,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 16:04:45,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:04:45,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:45,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,238 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:45,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:45,243 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:45,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:45,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:45,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:45,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:45,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:45,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:45,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2025-03-04 16:04:45,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:45,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:45,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:45,289 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,292 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:04:45,295 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-04 16:04:45,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:45,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:45,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:45,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:45,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:45,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:45,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:45,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:45,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,315 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:04:45,317 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-04 16:04:45,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:45,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:45,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:45,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:45,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:45,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:45,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:45,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:45,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:45,333 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:04:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,335 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:04:45,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:45,339 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:45,339 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:45,339 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2025-03-04 16:04:45,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:04:45,346 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:45,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:45,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:45,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:45,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:45,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:45,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:45,390 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-04 16:04:45,390 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:04:45,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:45,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 139 transitions. Complement of second has 5 states. [2025-03-04 16:04:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 16:04:45,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 5 letters. [2025-03-04 16:04:45,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 5 letters. [2025-03-04 16:04:45,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 10 letters. [2025-03-04 16:04:45,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 139 transitions. [2025-03-04 16:04:45,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:04:45,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 91 states and 94 transitions. [2025-03-04 16:04:45,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 16:04:45,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 16:04:45,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 94 transitions. [2025-03-04 16:04:45,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:45,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 94 transitions. [2025-03-04 16:04:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 94 transitions. [2025-03-04 16:04:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 50. [2025-03-04 16:04:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-04 16:04:45,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-04 16:04:45,417 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-04 16:04:45,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:04:45,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2025-03-04 16:04:45,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 16:04:45,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:45,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:45,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1] [2025-03-04 16:04:45,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:04:45,420 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;havoc main_#t~nondet1#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~j~0#1 < 8);main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" "assume main_~i~0#1 < main_~nlen~0#1;main_~j~0#1 := 0;" [2025-03-04 16:04:45,420 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 8;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-03-04 16:04:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -754623833, now seen corresponding path program 2 times [2025-03-04 16:04:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135778029] [2025-03-04 16:04:45,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 16:04:45,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:04:45,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:04:45,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:04:45,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:04:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 47677477, now seen corresponding path program 2 times [2025-03-04 16:04:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278995679] [2025-03-04 16:04:45,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:04:45,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash -94446273, now seen corresponding path program 3 times [2025-03-04 16:04:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:45,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717057248] [2025-03-04 16:04:45,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:04:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:45,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 10 equivalence classes. [2025-03-04 16:04:45,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:04:45,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 16:04:45,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:45,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:04:45,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:04:45,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:45,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:45,531 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:45,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:45,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:45,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:45,531 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:45,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:45,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:45,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2025-03-04 16:04:45,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:45,532 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:45,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:45,569 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,574 INFO L229 MonitoredProcess]: Starting monitored process 19 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-04 16:04:45,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:04:45,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:45,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,587 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:45,587 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:45,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:04:45,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,594 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:04:45,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:45,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,612 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:45,612 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:45,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 16:04:45,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,619 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:04:45,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:45,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:45,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,641 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:04:45,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:45,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:45,671 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:04:45,675 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:45,675 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:45,675 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:45,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:45,675 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:45,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:45,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:45,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2025-03-04 16:04:45,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:45,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:45,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:45,715 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:45,715 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:45,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,719 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:04:45,720 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-04 16:04:45,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:45,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:45,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:45,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:45,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:45,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:45,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:45,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:45,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 16:04:45,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,740 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:04:45,742 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-04 16:04:45,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:45,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:45,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:45,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:45,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:45,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:45,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:45,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:45,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 16:04:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,762 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:04:45,765 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-04 16:04:45,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:45,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:45,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:45,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:45,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:45,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:45,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:45,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:45,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:45,781 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:04:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,783 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:45,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:04:45,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:45,785 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:45,785 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:45,785 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2025-03-04 16:04:45,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:45,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:45,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:04:45,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:04:45,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:45,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:45,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:45,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:45,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:45,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:45,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:45,898 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-04 16:04:45,899 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:04:45,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:45,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 123 states and 127 transitions. Complement of second has 5 states. [2025-03-04 16:04:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 16:04:45,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 45 letters. Loop has 5 letters. [2025-03-04 16:04:45,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:45,918 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:45,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:04:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:04:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:45,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:45,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:45,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:46,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:46,018 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-04 16:04:46,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:04:46,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 123 states and 127 transitions. Complement of second has 5 states. [2025-03-04 16:04:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 16:04:46,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 45 letters. Loop has 5 letters. [2025-03-04 16:04:46,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,035 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:46,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 16:04:46,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 16:04:46,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:46,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:46,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:46,133 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-04 16:04:46,133 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:04:46,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 52 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 91 transitions. Complement of second has 4 states. [2025-03-04 16:04:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-03-04 16:04:46,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 45 letters. Loop has 5 letters. [2025-03-04 16:04:46,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 50 letters. Loop has 5 letters. [2025-03-04 16:04:46,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 45 letters. Loop has 10 letters. [2025-03-04 16:04:46,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 91 transitions. [2025-03-04 16:04:46,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:46,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:04:46,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:04:46,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:46,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:04:46,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:04:46,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:46,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:04:46,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:04:46 BoogieIcfgContainer [2025-03-04 16:04:46,164 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:04:46,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:04:46,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:04:46,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:04:46,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:42" (3/4) ... [2025-03-04 16:04:46,166 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:04:46,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:04:46,167 INFO L158 Benchmark]: Toolchain (without parser) took 3646.63ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 44.8MB in the end (delta: 79.3MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2025-03-04 16:04:46,167 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.92ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 112.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.04ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: Boogie Preprocessor took 21.70ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: IcfgBuilder took 161.05ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 99.0MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: BuchiAutomizer took 3305.55ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 44.9MB in the end (delta: 54.2MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2025-03-04 16:04:46,168 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 167.8MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:46,170 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.61ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.92ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 112.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.04ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.70ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 161.05ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 99.0MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 3305.55ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 44.9MB in the end (delta: 54.2MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 167.8MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 33.1kB). 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + nlen) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * j) + 15) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 15) and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:8. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 81 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 148/148 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 63 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:04:46,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:46,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:46,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 16:04:46,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 16:04:46,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE