./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test25-1.c --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/ldv-regression/test25-1.c -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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:00:20,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:00:20,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:00:20,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:00:20,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:00:20,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:00:20,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:00:20,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:00:20,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:00:20,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:00:20,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:00:20,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:00:20,591 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:00:20,591 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:00:20,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:00:20,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:00:20,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:00:20,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:00:20,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:00:20,595 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:00:20,595 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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2025-03-04 16:00:20,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:00:20,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:00:20,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:00:20,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:00:20,862 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:00:20,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-1.c [2025-03-04 16:00:22,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e3d29/32aff4468456499f8bbce0079040d037/FLAG9cb50c7b2 [2025-03-04 16:00:22,207 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:00:22,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2025-03-04 16:00:22,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e3d29/32aff4468456499f8bbce0079040d037/FLAG9cb50c7b2 [2025-03-04 16:00:22,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392e3d29/32aff4468456499f8bbce0079040d037 [2025-03-04 16:00:22,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:00:22,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:00:22,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:00:22,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:00:22,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:00:22,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6b9e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22, skipping insertion in model container [2025-03-04 16:00:22,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:00:22,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:00:22,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:00:22,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:00:22,728 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:00:22,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22 WrapperNode [2025-03-04 16:00:22,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:00:22,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:00:22,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:00:22,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:00:22,735 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:00:22" (1/1) ... [2025-03-04 16:00:22,745 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:00:22" (1/1) ... [2025-03-04 16:00:22,760 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-04 16:00:22,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:00:22,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:00:22,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:00:22,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:00:22,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,786 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-04 16:00:22,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:00:22,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:00:22,798 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:00:22,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:00:22,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (1/1) ... [2025-03-04 16:00:22,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:22,824 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:00:22,825 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:00:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:00:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:00:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:00:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:00:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:00:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:00:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:00:22,911 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:00:22,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:00:23,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: call ULTIMATE.dealloc(main_~#cont~0#1.base, main_~#cont~0#1.offset);havoc main_~#cont~0#1.base, main_~#cont~0#1.offset;call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-04 16:00:23,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc check_#t~mem4#1.base, check_#t~mem4#1.offset;havoc check_#t~mem5#1; [2025-03-04 16:00:23,080 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 16:00:23,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:00:23,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:00:23,086 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:00:23,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:23 BoogieIcfgContainer [2025-03-04 16:00:23,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:00:23,087 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:00:23,087 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:00:23,091 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:00:23,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:23,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:00:22" (1/3) ... [2025-03-04 16:00:23,094 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30a505aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:00:23, skipping insertion in model container [2025-03-04 16:00:23,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:23,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:22" (2/3) ... [2025-03-04 16:00:23,094 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30a505aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:00:23, skipping insertion in model container [2025-03-04 16:00:23,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:23,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:23" (3/3) ... [2025-03-04 16:00:23,095 INFO L363 chiAutomizerObserver]: Analyzing ICFG test25-1.c [2025-03-04 16:00:23,135 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:00:23,136 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:00:23,136 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:00:23,136 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:00:23,136 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:00:23,136 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:00:23,136 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:00:23,136 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:00:23,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:23,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-04 16:00:23,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:23,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:23,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:00:23,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:00:23,156 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:00:23,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:23,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-04 16:00:23,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:23,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:23,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:00:23,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:00:23,163 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" [2025-03-04 16:00:23,163 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 16:00:23,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 1 times [2025-03-04 16:00:23,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793552696] [2025-03-04 16:00:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:23,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:23,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:23,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:23,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:23,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-03-04 16:00:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233028457] [2025-03-04 16:00:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:23,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:23,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:23,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:23,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:23,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:23,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 56569, now seen corresponding path program 1 times [2025-03-04 16:00:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070210095] [2025-03-04 16:00:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:23,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:23,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:23,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:23,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:23,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:23,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:23,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:23,840 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:00:23,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:00:23,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:00:23,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:00:23,841 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:00:23,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:23,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:00:23,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:00:23,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: test25-1.c_Iteration1_Lasso [2025-03-04 16:00:23,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:00:23,841 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:00:23,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:23,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:24,341 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:00:24,344 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:00:24,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,348 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:00:24,350 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:00:24,351 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:00:24,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,377 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:00:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,380 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:00:24,382 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:00:24,383 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:00:24,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,404 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:00:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,406 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:00:24,408 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:00:24,410 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:00:24,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,429 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:00:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,431 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:00:24,433 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:00:24,435 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:00:24,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,458 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:00:24,459 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:00:24,461 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:00:24,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:00:24,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,483 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:00:24,484 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:00:24,486 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:00:24,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,506 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:00:24,527 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:00:24,528 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:00:24,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,548 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:00:24,550 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:00:24,551 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:00:24,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,573 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:00:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,575 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:00:24,577 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:00:24,578 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:00:24,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,601 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:00:24,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,603 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:00:24,605 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:00:24,606 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:00:24,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,627 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:00:24,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,629 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:00:24,632 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:00:24,633 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:00:24,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:00:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,659 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:00:24,660 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:00:24,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:00:24,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,685 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:00:24,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,688 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:00:24,689 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:00:24,691 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:00:24,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,709 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:00:24,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,711 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:00:24,713 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:00:24,714 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:00:24,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,737 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:00:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,740 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:00:24,742 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:00:24,743 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:00:24,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,768 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:00:24,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:00:24,771 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:00:24,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,797 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:00:24,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:00:24,800 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:00:24,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:24,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:24,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:24,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,821 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:00:24,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:00:24,824 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:00:24,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:24,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:00:24,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,852 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:00:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:00:24,855 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:00:24,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:24,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:24,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:24,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:24,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:24,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:24,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:00:24,902 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 16:00:24,904 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 16:00:24,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,908 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:00:24,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:00:24,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:00:24,924 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:00:24,924 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:00:24,924 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1) = -16*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1 Supporting invariants [] [2025-03-04 16:00:24,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:24,957 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 16:00:24,964 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:00:24,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:00:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:24,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:24,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:24,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:00:24,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:25,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:25,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:00:25,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,040 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:00:25,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 23 transitions. Complement of second has 3 states. [2025-03-04 16:00:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 16:00:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 16:00:25,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 16:00:25,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:25,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 16:00:25,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:25,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 16:00:25,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:25,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-03-04 16:00:25,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 10 transitions. [2025-03-04 16:00:25,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 16:00:25,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 16:00:25,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2025-03-04 16:00:25,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:25,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 16:00:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2025-03-04 16:00:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 16:00:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-04 16:00:25,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 16:00:25,104 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 16:00:25,104 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:00:25,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-03-04 16:00:25,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:25,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:25,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:00:25,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:25,106 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-04 16:00:25,106 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-04 16:00:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 54362550, now seen corresponding path program 1 times [2025-03-04 16:00:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564727011] [2025-03-04 16:00:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:00:25,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:00:25,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,184 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:00:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564727011] [2025-03-04 16:00:25,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564727011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:25,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:00:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:00:25,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134075930] [2025-03-04 16:00:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:25,187 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2025-03-04 16:00:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817275417] [2025-03-04 16:00:25,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:25,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:25,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:25,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:00:25,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:00:25,224 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:25,231 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-04 16:00:25,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-04 16:00:25,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-03-04 16:00:25,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 16:00:25,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 16:00:25,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-03-04 16:00:25,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:25,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 16:00:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-03-04 16:00:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 16:00:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-04 16:00:25,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 16:00:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:00:25,234 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 16:00:25,234 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:00:25,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-03-04 16:00:25,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:25,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:25,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:00:25,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:25,234 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-04 16:00:25,234 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-04 16:00:25,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1685270845, now seen corresponding path program 1 times [2025-03-04 16:00:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693899528] [2025-03-04 16:00:25,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:00:25,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:00:25,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693899528] [2025-03-04 16:00:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693899528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990572624] [2025-03-04 16:00:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:25,300 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:00:25,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 16:00:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:00:25,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:00:25,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:00:25,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990572624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:25,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:25,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 16:00:25,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600078422] [2025-03-04 16:00:25,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:25,401 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times [2025-03-04 16:00:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353912563] [2025-03-04 16:00:25,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:00:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:25,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:25,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:00:25,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:00:25,454 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:25,472 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-03-04 16:00:25,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2025-03-04 16:00:25,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2025-03-04 16:00:25,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 16:00:25,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 16:00:25,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-03-04 16:00:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:25,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-04 16:00:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-03-04 16:00:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-04 16:00:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-04 16:00:25,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-04 16:00:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:00:25,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-04 16:00:25,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:00:25,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-03-04 16:00:25,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:25,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:25,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1] [2025-03-04 16:00:25,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:25,476 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-04 16:00:25,476 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-04 16:00:25,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2062592886, now seen corresponding path program 2 times [2025-03-04 16:00:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671502972] [2025-03-04 16:00:25,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 16:00:25,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:00:25,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:00:25,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:00:25,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671502972] [2025-03-04 16:00:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671502972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828982977] [2025-03-04 16:00:25,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:25,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:25,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:25,672 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:00:25,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 16:00:25,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 16:00:25,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:00:25,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:00:25,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:25,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:00:25,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828982977] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:25,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 16:00:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43096502] [2025-03-04 16:00:25,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:25,813 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times [2025-03-04 16:00:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519942461] [2025-03-04 16:00:25,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:00:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:00:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:25,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:25,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:25,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:25,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:25,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 16:00:25,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 16:00:25,852 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:25,884 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-04 16:00:25,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-03-04 16:00:25,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2025-03-04 16:00:25,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 16:00:25,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 16:00:25,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2025-03-04 16:00:25,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:25,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-04 16:00:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2025-03-04 16:00:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 16:00:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-04 16:00:25,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-04 16:00:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 16:00:25,889 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-04 16:00:25,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:00:25,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2025-03-04 16:00:25,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 16:00:25,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:25,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:25,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-03-04 16:00:25,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:25,892 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-04 16:00:25,892 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-04 16:00:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1289746922, now seen corresponding path program 3 times [2025-03-04 16:00:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227001270] [2025-03-04 16:00:25,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:00:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-04 16:00:25,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:00:25,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 16:00:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:25,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:00:26,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:00:26,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:26,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:26,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times [2025-03-04 16:00:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019822907] [2025-03-04 16:00:26,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:00:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:26,121 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 16:00:26,125 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:26,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:00:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:26,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:26,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:26,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:26,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:26,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1798757077, now seen corresponding path program 1 times [2025-03-04 16:00:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:26,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034432072] [2025-03-04 16:00:26,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:00:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:00:26,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:26,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:00:26,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:00:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:26,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace