./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/fragtest_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/fragtest_simple.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 be3b53cc5f9badbf5402cafcfa5766831674eb009261bc7c1bcbe9580aece38e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:04:36,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:04:36,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:04:36,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:04:36,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:04:36,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:04:36,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:04:36,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:04:36,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:04:36,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:04:36,876 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:04:36,876 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:04:36,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:04:36,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:04:36,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:04:36,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:04:36,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:04:36,878 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:04:36,878 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 -> be3b53cc5f9badbf5402cafcfa5766831674eb009261bc7c1bcbe9580aece38e [2025-03-04 16:04:37,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:04:37,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:04:37,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:04:37,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:04:37,105 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:04:37,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/fragtest_simple.i [2025-03-04 16:04:38,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36db8454/caa27c14c5204c839eb7d0b6fb85083d/FLAGbf98cc038 [2025-03-04 16:04:38,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:04:38,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/fragtest_simple.i [2025-03-04 16:04:38,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36db8454/caa27c14c5204c839eb7d0b6fb85083d/FLAGbf98cc038 [2025-03-04 16:04:38,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36db8454/caa27c14c5204c839eb7d0b6fb85083d [2025-03-04 16:04:38,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:04:38,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:04:38,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:38,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:04:38,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:04:38,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:38" (1/1) ... [2025-03-04 16:04:38,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ade8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:38, skipping insertion in model container [2025-03-04 16:04:38,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:38" (1/1) ... [2025-03-04 16:04:38,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:04:38,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:38,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:04:38,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:39,000 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:04:39,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39 WrapperNode [2025-03-04 16:04:39,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:39,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:39,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:04:39,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:04:39,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,019 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-03-04 16:04:39,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:39,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:04:39,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:04:39,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:04:39,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,036 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 16:04:39,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:04:39,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:04:39,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:04:39,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:04:39,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (1/1) ... [2025-03-04 16:04:39,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:04:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:04:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:04:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:04:39,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:04:39,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:04:39,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:04:39,216 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 16:04:39,217 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:04:39,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:04:39,225 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:04:39,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:39 BoogieIcfgContainer [2025-03-04 16:04:39,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:04:39,226 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:04:39,226 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:04:39,230 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:04:39,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:39,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:04:38" (1/3) ... [2025-03-04 16:04:39,232 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ae82963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:39, skipping insertion in model container [2025-03-04 16:04:39,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:39,232 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:39" (2/3) ... [2025-03-04 16:04:39,232 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ae82963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:39, skipping insertion in model container [2025-03-04 16:04:39,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:39,232 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:39" (3/3) ... [2025-03-04 16:04:39,233 INFO L363 chiAutomizerObserver]: Analyzing ICFG fragtest_simple.i [2025-03-04 16:04:39,263 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:04:39,263 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:04:39,263 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:04:39,263 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:04:39,263 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:04:39,263 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:04:39,264 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:04:39,264 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:04:39,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:39,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:04:39,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:39,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:39,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:39,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:39,279 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:04:39,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:39,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-03-04 16:04:39,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:39,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:39,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:04:39,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:39,285 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;havoc main_#t~nondet1#1;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 16:04:39,285 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet2#1;" "assume 0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000;havoc main_#t~nondet2#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-04 16:04:39,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 1 times [2025-03-04 16:04:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307029693] [2025-03-04 16:04:39,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2025-03-04 16:04:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767069628] [2025-03-04 16:04:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1907551, now seen corresponding path program 1 times [2025-03-04 16:04:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628400280] [2025-03-04 16:04:39,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:39,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:39,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,446 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:39,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:39,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:39,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:39,447 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:39,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:39,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:39,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration1_Loop [2025-03-04 16:04:39,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:39,447 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:39,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:39,496 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,500 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:04:39,501 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:04:39,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:39,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,520 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:04:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,522 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:04:39,523 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:04:39,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:39,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,549 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:39,553 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:04:39,553 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:39,553 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:39,553 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:39,553 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:39,553 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:39,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:39,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:39,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration1_Loop [2025-03-04 16:04:39,554 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:39,554 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:39,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,583 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:39,586 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 16:04:39,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:39,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:39,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:39,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:39,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:39,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:39,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:39,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:39,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:39,616 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:04:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 16:04:39,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:39,623 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:39,624 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:39,624 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2025-03-04 16:04:39,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:39,632 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:39,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:39,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:39,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:39,669 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:39,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:39,695 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:04:39,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:39,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 55 transitions. Complement of second has 6 states. [2025-03-04 16:04:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-03-04 16:04:39,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 16:04:39,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:39,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 16:04:39,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:39,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 16:04:39,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:39,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 55 transitions. [2025-03-04 16:04:39,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 16:04:39,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 18 states and 25 transitions. [2025-03-04 16:04:39,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 16:04:39,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 16:04:39,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2025-03-04 16:04:39,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:39,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-04 16:04:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2025-03-04 16:04:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 16:04:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2025-03-04 16:04:39,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-04 16:04:39,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-04 16:04:39,764 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:04:39,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2025-03-04 16:04:39,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 16:04:39,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:39,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:39,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:04:39,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:39,765 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;havoc main_#t~nondet1#1;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;havoc main_#t~nondet2#1;" "assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1;" "assume !(main_~i~0#1 > main_~pvlen~0#1);" "main_~i~0#1 := 0;" [2025-03-04 16:04:39,765 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000;havoc main_#t~nondet3#1;main_~tmp___1~0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~k~0#1 := 1 + main_~k~0#1;" [2025-03-04 16:04:39,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1833156316, now seen corresponding path program 1 times [2025-03-04 16:04:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941243838] [2025-03-04 16:04:39,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:04:39,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:04:39,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:04:39,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:04:39,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 1 times [2025-03-04 16:04:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534135163] [2025-03-04 16:04:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:39,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:39,784 INFO L85 PathProgramCache]: Analyzing trace with hash 726628955, now seen corresponding path program 1 times [2025-03-04 16:04:39,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:39,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97865934] [2025-03-04 16:04:39,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:39,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:04:39,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:04:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:39,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:04:39,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:04:39,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:39,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:39,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:39,836 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:39,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:39,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:39,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:39,836 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:39,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:39,836 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:39,836 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration2_Loop [2025-03-04 16:04:39,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:39,836 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:39,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,873 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:39,873 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:39,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,876 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 16:04:39,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:39,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:39,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:04:39,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:39,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,927 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:39,927 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [{ULTIMATE.start_main_~k~0#1=-1}, {ULTIMATE.start_main_~k~0#1=5}, {ULTIMATE.start_main_~k~0#1=-3}] Lambdas: [6, 1, 1] Nus: [1, 0] [2025-03-04 16:04:39,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:04:39,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:04:39,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:39,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:04:39,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:39,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:39,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:04:39,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:39,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:39,988 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:39,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:04:39,992 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:39,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:39,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:39,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:39,992 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:39,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:39,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:39,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:39,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration2_Loop [2025-03-04 16:04:39,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:39,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:39,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:39,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:40,024 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:40,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:04:40,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:40,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:40,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:40,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:40,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:40,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:40,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:40,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:40,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:40,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:04:40,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:40,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:40,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:40,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:40,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:40,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:40,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:40,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:40,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:40,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:40,069 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:04:40,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,072 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:04:40,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:40,073 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:40,073 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:40,073 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2025-03-04 16:04:40,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:40,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:40,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:04:40,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:04:40,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:40,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:40,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:40,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:40,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:40,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:40,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:40,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:40,123 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:04:40,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 52 transitions. Complement of second has 6 states. [2025-03-04 16:04:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-03-04 16:04:40,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 16:04:40,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 16:04:40,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 16:04:40,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2025-03-04 16:04:40,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:04:40,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 23 states and 30 transitions. [2025-03-04 16:04:40,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-04 16:04:40,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-04 16:04:40,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2025-03-04 16:04:40,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:40,147 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-04 16:04:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2025-03-04 16:04:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-04 16:04:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-04 16:04:40,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-04 16:04:40,149 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-04 16:04:40,149 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:04:40,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-03-04 16:04:40,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:04:40,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:40,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:40,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:40,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:04:40,150 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;havoc main_#t~nondet1#1;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;havoc main_#t~nondet2#1;" "assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1;" "assume !(main_~i~0#1 > main_~pvlen~0#1);" "main_~i~0#1 := 0;" "assume true;havoc main_#t~nondet3#1;" "assume !(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1;" "main_~j~0#1 := 0;main_~n~0#1 := main_~i~0#1;" "assume true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" [2025-03-04 16:04:40,150 INFO L754 eck$LassoCheckResult]: Loop: "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~k~0#1 := main_~k~0#1 - 1;main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 >= main_~n~0#1);" "assume true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" [2025-03-04 16:04:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 368011604, now seen corresponding path program 1 times [2025-03-04 16:04:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799827176] [2025-03-04 16:04:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:04:40,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:04:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:40,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:40,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:04:40,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:04:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:40,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1076735, now seen corresponding path program 1 times [2025-03-04 16:04:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934012272] [2025-03-04 16:04:40,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:40,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:40,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:40,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:40,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:40,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:40,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1387591122, now seen corresponding path program 1 times [2025-03-04 16:04:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654566563] [2025-03-04 16:04:40,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:40,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:04:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:04:40,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:40,236 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:04:40,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654566563] [2025-03-04 16:04:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654566563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:04:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:04:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:04:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314484176] [2025-03-04 16:04:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:04:40,375 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:40,375 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:40,375 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:40,375 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:40,375 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:40,375 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,375 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:40,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:40,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration3_Loop [2025-03-04 16:04:40,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:40,375 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:40,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:40,428 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:04:40,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:40,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:40,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 16:04:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,451 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:04:40,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:40,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:40,538 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:40,543 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:04:40,543 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:40,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:40,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:40,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:40,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:40,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:40,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:40,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration3_Loop [2025-03-04 16:04:40,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:40,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:40,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:40,595 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:40,595 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,598 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:04:40,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:40,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:40,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:40,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:40,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:40,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:40,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:40,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:40,615 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:40,619 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:04:40,619 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:40,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:40,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:04:40,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:40,623 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:40,623 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:40,623 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 16:04:40,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:40,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:40,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:04:40,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:04:40,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:40,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:40,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:40,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:40,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:40,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:40,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:40,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:40,689 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:04:40,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2025-03-04 16:04:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2025-03-04 16:04:40,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-04 16:04:40,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 15 letters. Loop has 4 letters. [2025-03-04 16:04:40,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 8 letters. [2025-03-04 16:04:40,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:40,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2025-03-04 16:04:40,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:40,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-03-04 16:04:40,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:04:40,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:04:40,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:04:40,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:40,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:40,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:40,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:04:40,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:04:40,711 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:40,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 16:04:40,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 16:04:40,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:40,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 16:04:40,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:04:40,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:04:40,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:04:40,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:40,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:40,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 16:04:40,714 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:40,714 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:04:40,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:04:40,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:40,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:04:40,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:04:40 BoogieIcfgContainer [2025-03-04 16:04:40,721 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:04:40,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:04:40,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:04:40,722 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:04:40,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:39" (3/4) ... [2025-03-04 16:04:40,724 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:04:40,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:04:40,725 INFO L158 Benchmark]: Toolchain (without parser) took 1869.97ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 87.0MB in the end (delta: 36.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2025-03-04 16:04:40,725 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:40,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.41ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:04:40,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.18ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:40,726 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 110.2MB in the end (delta: 906.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:40,726 INFO L158 Benchmark]: IcfgBuilder took 180.43ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 99.0MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:04:40,727 INFO L158 Benchmark]: BuchiAutomizer took 1495.14ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 87.1MB in the end (delta: 12.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-03-04 16:04:40,727 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:40,728 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.17ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.41ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.18ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 110.2MB in the end (delta: 906.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.43ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 99.0MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1495.14ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 87.1MB in the end (delta: 12.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 50.8kB). 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 2000001) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 2000001) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * j) + n) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 34 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:04:40,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:04:40,943 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