./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.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-lit/cggmp2005b.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 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:05:04,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:05:04,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:05:04,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:05:04,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:05:04,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:05:04,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:05:04,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:05:04,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:05:04,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:05:04,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:05:04,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:05:04,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:05:04,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:05:04,323 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:05:04,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:05:04,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:05:04,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:05:04,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:05:04,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:05:04,325 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:05:04,325 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 -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c [2025-03-04 16:05:04,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:05:04,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:05:04,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:05:04,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:05:04,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:05:04,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2025-03-04 16:05:05,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c232a111/a74bb001fce844f2aa7e7679bb3beb7a/FLAG2b0d04f88 [2025-03-04 16:05:05,876 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:05:05,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2025-03-04 16:05:05,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c232a111/a74bb001fce844f2aa7e7679bb3beb7a/FLAG2b0d04f88 [2025-03-04 16:05:06,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c232a111/a74bb001fce844f2aa7e7679bb3beb7a [2025-03-04 16:05:06,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:05:06,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:05:06,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:06,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:05:06,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:05:06,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291ba286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06, skipping insertion in model container [2025-03-04 16:05:06,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:05:06,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:06,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:05:06,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:06,341 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:05:06,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06 WrapperNode [2025-03-04 16:05:06,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:06,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:06,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:05:06,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:05:06,347 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:05:06" (1/1) ... [2025-03-04 16:05:06,351 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:05:06" (1/1) ... [2025-03-04 16:05:06,359 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2025-03-04 16:05:06,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:06,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:05:06,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:05:06,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:05:06,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,372 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:05:06,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:05:06,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:05:06,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:05:06,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:05:06,378 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (1/1) ... [2025-03-04 16:05:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:06,409 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:05:06,411 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:05:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:05:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:05:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:05:06,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:05:06,457 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:05:06,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:05:06,537 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-04 16:05:06,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:05:06,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:05:06,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:05:06,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:06 BoogieIcfgContainer [2025-03-04 16:05:06,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:05:06,548 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:05:06,548 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:05:06,553 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:05:06,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:06,553 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:05:06" (1/3) ... [2025-03-04 16:05:06,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8e8344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:06, skipping insertion in model container [2025-03-04 16:05:06,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:06,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:06" (2/3) ... [2025-03-04 16:05:06,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d8e8344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:06, skipping insertion in model container [2025-03-04 16:05:06,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:06,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:06" (3/3) ... [2025-03-04 16:05:06,555 INFO L363 chiAutomizerObserver]: Analyzing ICFG cggmp2005b.i [2025-03-04 16:05:06,594 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:05:06,594 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:05:06,594 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:05:06,594 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:05:06,594 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:05:06,594 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:05:06,595 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:05:06,595 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:05:06,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:05:06,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 16:05:06,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:06,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:06,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:06,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:05:06,618 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:05:06,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:05:06,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 16:05:06,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:06,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:06,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:06,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:05:06,624 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_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" [2025-03-04 16:05:06,625 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" [2025-03-04 16:05:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-04 16:05:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169612659] [2025-03-04 16:05:06,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:06,687 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:06,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:06,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:06,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-03-04 16:05:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467969912] [2025-03-04 16:05:06,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:06,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:05:06,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:05:06,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:06,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:06,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:06,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:05:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:05:06,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:06,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:06,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:06,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash 44820494, now seen corresponding path program 1 times [2025-03-04 16:05:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341958314] [2025-03-04 16:05:06,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:05:06,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:06,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:06,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:06,781 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:05:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:06,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341958314] [2025-03-04 16:05:06,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341958314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:05:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465052421] [2025-03-04 16:05:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:06,853 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:06,854 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:06,854 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:06,854 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:06,854 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:05:06,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:06,855 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:06,855 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:06,855 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration1_Loop [2025-03-04 16:05:06,855 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:06,855 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:06,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:06,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:06,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:06,923 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:06,923 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:05:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:06,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:06,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 16:05:06,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:06,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:06,950 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:05:06,950 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=20} Honda state: {ULTIMATE.start_main_~j~0#1=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:05:06,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 16:05:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:06,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:06,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 16:05:06,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:06,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:06,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 16:05:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:06,980 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:05:06,981 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:05:06,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:05:06,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:07,004 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:05:07,007 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:05:07,008 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:07,008 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:07,008 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:07,008 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:07,008 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:05:07,008 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,008 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:07,008 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:07,008 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration1_Loop [2025-03-04 16:05:07,008 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:07,008 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:07,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,041 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:07,047 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:05:07,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,050 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:05:07,051 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:05:07,052 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:05:07,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:07,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:07,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:07,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:07,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:07,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:07,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:07,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:05:07,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 16:05:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,076 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:05:07,077 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:05:07,078 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:05:07,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:07,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:07,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:07,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:07,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:07,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:07,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:07,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:05:07,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:05:07,097 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:05:07,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,100 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:05:07,101 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:05:07,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:05:07,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:05:07,103 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:05:07,103 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 201 Supporting invariants [] [2025-03-04 16:05:07,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:05:07,113 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:05:07,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:07,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:07,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:05:07,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:05:07,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:07,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:07,191 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:05:07,209 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:05:07,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 33 transitions. Complement of second has 5 states. [2025-03-04 16:05:07,232 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:05:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-04 16:05:07,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-04 16:05:07,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 16:05:07,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-04 16:05:07,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 33 transitions. [2025-03-04 16:05:07,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:07,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 18 transitions. [2025-03-04 16:05:07,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 16:05:07,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 16:05:07,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2025-03-04 16:05:07,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:07,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 18 transitions. [2025-03-04 16:05:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2025-03-04 16:05:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-03-04 16:05:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:05:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2025-03-04 16:05:07,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 15 transitions. [2025-03-04 16:05:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:07,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:07,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:07,265 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:07,273 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2025-03-04 16:05:07,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 17 transitions. [2025-03-04 16:05:07,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:07,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 17 transitions. [2025-03-04 16:05:07,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 16:05:07,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 16:05:07,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 17 transitions. [2025-03-04 16:05:07,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:07,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-03-04 16:05:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 17 transitions. [2025-03-04 16:05:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 16:05:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 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:05:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2025-03-04 16:05:07,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-03-04 16:05:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:07,277 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-03-04 16:05:07,277 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:05:07,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 17 transitions. [2025-03-04 16:05:07,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:07,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:07,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:07,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:05:07,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:05:07,277 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_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-03-04 16:05:07,278 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-03-04 16:05:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1445823, now seen corresponding path program 1 times [2025-03-04 16:05:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515142808] [2025-03-04 16:05:07,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:07,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:05:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:05:07,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:07,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:05:07,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:05:07,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-04 16:05:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424327694] [2025-03-04 16:05:07,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:07,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:07,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:07,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:07,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:07,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 44820527, now seen corresponding path program 2 times [2025-03-04 16:05:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:07,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596195438] [2025-03-04 16:05:07,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:07,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-04 16:05:07,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:07,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:05:07,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:07,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:05:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:07,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:07,481 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:07,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:07,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:07,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:07,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:05:07,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:07,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:07,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Lasso [2025-03-04 16:05:07,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:07,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:07,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:07,563 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:05:07,646 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:07,646 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:05:07,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,650 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:05:07,652 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:05:07,652 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:05:07,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:07,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:07,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:07,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:07,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:05:07,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:05:07,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:05:07,682 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 16:05:07,683 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 16:05:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,700 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:05:07,702 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:05:07,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:05:07,715 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 16:05:07,715 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:05:07,715 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 39*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~i~0#1 - 1 >= 0] [2025-03-04 16:05:07,721 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:05:07,729 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-03-04 16:05:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:05:07,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:05:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:07,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:05:07,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:07,795 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:05:07,795 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-03-04 16:05:07,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 17 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 17 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 34 transitions. Complement of second has 7 states. [2025-03-04 16:05:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:05:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-03-04 16:05:07,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-04 16:05:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 16:05:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 16:05:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:07,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2025-03-04 16:05:07,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 16:05:07,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 28 transitions. [2025-03-04 16:05:07,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 16:05:07,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 16:05:07,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 28 transitions. [2025-03-04 16:05:07,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:07,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 28 transitions. [2025-03-04 16:05:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 28 transitions. [2025-03-04 16:05:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2025-03-04 16:05:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2025-03-04 16:05:07,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 21 transitions. [2025-03-04 16:05:07,834 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 21 transitions. [2025-03-04 16:05:07,834 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:05:07,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 21 transitions. [2025-03-04 16:05:07,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:07,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:07,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:07,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:05:07,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:05:07,835 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_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" [2025-03-04 16:05:07,835 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= 3;main_~k~0#1 := 1 + main_~k~0#1;" [2025-03-04 16:05:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 44820526, now seen corresponding path program 1 times [2025-03-04 16:05:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:07,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618575345] [2025-03-04 16:05:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:07,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:05:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,889 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:05:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618575345] [2025-03-04 16:05:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618575345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346428904] [2025-03-04 16:05:07,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:07,895 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:07,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 16:05:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:05:07,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:07,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:07,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:05:07,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:07,949 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:05:07,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:07,975 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:05:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346428904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:07,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 16:05:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407678814] [2025-03-04 16:05:07,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:07,975 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:05:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-03-04 16:05:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829104555] [2025-03-04 16:05:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:07,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:07,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:07,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:07,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:07,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:07,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:07,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:07,992 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:07,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:07,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:07,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:07,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:05:07,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:07,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:07,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:07,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Loop [2025-03-04 16:05:07,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:07,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:07,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:08,007 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:08,007 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:05:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,009 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:05:08,011 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:05:08,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:08,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:08,032 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:05:08,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,034 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:05:08,035 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:05:08,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:05:08,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:08,058 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:05:08,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:05:08,062 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:08,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:08,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:08,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:08,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:05:08,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:08,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:08,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Loop [2025-03-04 16:05:08,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:08,062 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:08,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:08,083 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:08,083 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:05:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,085 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:05:08,086 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:05:08,089 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:05:08,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:08,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:08,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:08,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:08,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:08,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:08,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:08,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:05:08,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:05:08,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:05:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,106 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:05:08,107 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:05:08,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:05:08,108 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:05:08,108 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:05:08,109 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2025-03-04 16:05:08,114 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:05:08,115 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:05:08,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:05:08,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:05:08,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,144 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,145 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:05:08,145 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:05:08,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 21 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:08,154 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 21 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 43 transitions. Complement of second has 5 states. [2025-03-04 16:05:08,154 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:05:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 16:05:08,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 16:05:08,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 16:05:08,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 16:05:08,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 43 transitions. [2025-03-04 16:05:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 16:05:08,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 29 transitions. [2025-03-04 16:05:08,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 16:05:08,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-04 16:05:08,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 29 transitions. [2025-03-04 16:05:08,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:08,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 29 transitions. [2025-03-04 16:05:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 29 transitions. [2025-03-04 16:05:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2025-03-04 16:05:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2025-03-04 16:05:08,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 16 transitions. [2025-03-04 16:05:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:05:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:05:08,157 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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:05:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:08,186 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2025-03-04 16:05:08,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-03-04 16:05:08,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:08,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2025-03-04 16:05:08,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 16:05:08,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 16:05:08,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2025-03-04 16:05:08,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:08,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-03-04 16:05:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2025-03-04 16:05:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 16:05:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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:05:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2025-03-04 16:05:08,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-03-04 16:05:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:05:08,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-03-04 16:05:08,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:05:08,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2025-03-04 16:05:08,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:05:08,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:08,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:08,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2025-03-04 16:05:08,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:05:08,189 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_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" [2025-03-04 16:05:08,190 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= 3;main_~k~0#1 := 1 + main_~k~0#1;" [2025-03-04 16:05:08,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 629423612, now seen corresponding path program 1 times [2025-03-04 16:05:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575374798] [2025-03-04 16:05:08,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:08,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:08,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575374798] [2025-03-04 16:05:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575374798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:05:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946988098] [2025-03-04 16:05:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:05:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,275 INFO L229 MonitoredProcess]: Starting monitored process 15 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:05:08,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 16:05:08,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:08,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:08,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:08,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:05:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946988098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:05:08,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:05:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 16:05:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417038009] [2025-03-04 16:05:08,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:05:08,416 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:05:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 2 times [2025-03-04 16:05:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37504598] [2025-03-04 16:05:08,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:08,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:08,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:08,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:08,433 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:08,433 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:08,433 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:08,433 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:08,433 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:05:08,433 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,433 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:08,433 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:08,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2025-03-04 16:05:08,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:08,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:08,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:08,446 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:08,446 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:05:08,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,448 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:05:08,450 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:05:08,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:08,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:08,468 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:05:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,472 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:05:08,473 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:05:08,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:05:08,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:08,499 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:05:08,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:08,503 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:08,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:08,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:08,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:08,503 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:05:08,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:08,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:08,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2025-03-04 16:05:08,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:08,504 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:08,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:08,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:08,526 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:05:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,528 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:05:08,530 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:05:08,532 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:05:08,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:08,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:08,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:08,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:08,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:08,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:08,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:08,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:05:08,547 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:05:08,547 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:05:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:08,549 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:05:08,550 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:05:08,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:05:08,551 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:05:08,551 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:05:08,551 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2025-03-04 16:05:08,558 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:05:08,559 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:05:08,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:08,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,596 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:05:08,596 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:05:08,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 23 states and 38 transitions. Complement of second has 5 states. [2025-03-04 16:05:08,604 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:05:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 16:05:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-04 16:05:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,606 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:05:08,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:08,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:08,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,639 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:05:08,639 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:05:08,640 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,647 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 23 states and 38 transitions. Complement of second has 5 states. [2025-03-04 16:05:08,648 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:05:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 16:05:08,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-04 16:05:08,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,649 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:05:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:08,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:08,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,680 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:08,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:08,680 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:05:08,680 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 1 loop predicates [2025-03-04 16:05:08,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,688 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 19 states and 28 transitions. Complement of second has 4 states. [2025-03-04 16:05:08,688 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:05:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:05:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 16:05:08,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-04 16:05:08,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2025-03-04 16:05:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-04 16:05:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:08,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2025-03-04 16:05:08,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:05:08,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 17 transitions. [2025-03-04 16:05:08,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 16:05:08,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 16:05:08,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-04 16:05:08,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:08,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 16:05:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-04 16:05:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-04 16:05:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:05:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-04 16:05:08,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-04 16:05:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:08,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 16:05:08,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-03-04 16:05:08,693 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:08,729 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:05:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:08,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:08,789 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2025-03-04 16:05:08,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-03-04 16:05:08,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:05:08,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2025-03-04 16:05:08,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 16:05:08,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 16:05:08,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2025-03-04 16:05:08,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:08,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-04 16:05:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2025-03-04 16:05:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 16:05:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-04 16:05:08,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-04 16:05:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:05:08,792 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-04 16:05:08,792 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:05:08,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-04 16:05:08,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:05:08,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:08,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:08,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 2, 1, 1, 1, 1] [2025-03-04 16:05:08,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:05:08,793 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_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-03-04 16:05:08,793 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-03-04 16:05:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -49686019, now seen corresponding path program 2 times [2025-03-04 16:05:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478732306] [2025-03-04 16:05:08,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:08,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 16:05:08,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:05:08,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:05:08,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 16:05:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478732306] [2025-03-04 16:05:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478732306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 16:05:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641623744] [2025-03-04 16:05:08,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:08,844 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:05:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 2 times [2025-03-04 16:05:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035405668] [2025-03-04 16:05:08,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:08,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:08,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:05:08,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:05:08,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:08,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:08,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:08,858 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 4.0) 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:05:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:08,863 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-03-04 16:05:08,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-03-04 16:05:08,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:05:08,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2025-03-04 16:05:08,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:05:08,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:05:08,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:05:08,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:05:08,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:05:08,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:05:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:08,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:05:08,865 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:05:08,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:05:08,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:05:08,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:05:08,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:05:08 BoogieIcfgContainer [2025-03-04 16:05:08,871 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:05:08,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:05:08,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:05:08,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:05:08,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:06" (3/4) ... [2025-03-04 16:05:08,873 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:05:08,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:05:08,874 INFO L158 Benchmark]: Toolchain (without parser) took 2681.70ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 119.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2025-03-04 16:05:08,874 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:08,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.74ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 110.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:05:08,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.74ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.9MB in the end (delta: 737.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:08,874 INFO L158 Benchmark]: Boogie Preprocessor took 16.28ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:05:08,875 INFO L158 Benchmark]: IcfgBuilder took 170.97ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 98.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:05:08,875 INFO L158 Benchmark]: BuchiAutomizer took 2322.19ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 120.5MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:08,875 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 119.5MB in the end (delta: 977.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:08,876 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.12ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.74ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 110.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.74ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.9MB in the end (delta: 737.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.28ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 170.97ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 98.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2322.19ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 120.5MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 119.5MB in the end (delta: 977.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 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 201) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * j) + ((long long) 39 * i)) and consists of 5 locations. One deterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. One nondeterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:8. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 67 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN1 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 68ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 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:05:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:09,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 16:05:09,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE