./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:56:02,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:56:02,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:56:02,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:56:02,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:56:02,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:56:02,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:56:02,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:56:02,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:56:02,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:56:02,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:56:02,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:56:02,131 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:56:02,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:56:02,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:56:02,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:56:02,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:56:02,132 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:56:02,132 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 [2025-03-17 19:56:02,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:56:02,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:56:02,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:56:02,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:56:02,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:56:02,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2025-03-17 19:56:03,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68690a38/cddccaccfe0041aa8b62ca9776343411/FLAGcb9bca426 [2025-03-17 19:56:03,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:56:03,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2025-03-17 19:56:03,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68690a38/cddccaccfe0041aa8b62ca9776343411/FLAGcb9bca426 [2025-03-17 19:56:03,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68690a38/cddccaccfe0041aa8b62ca9776343411 [2025-03-17 19:56:03,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:56:03,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:56:03,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:56:03,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:56:03,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:56:03,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:56:03" (1/1) ... [2025-03-17 19:56:03,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1910944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:03, skipping insertion in model container [2025-03-17 19:56:03,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:56:03" (1/1) ... [2025-03-17 19:56:03,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:56:04,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:56:04,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:56:04,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:56:04,123 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:56:04,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04 WrapperNode [2025-03-17 19:56:04,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:56:04,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:56:04,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:56:04,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:56:04,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,151 INFO L138 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-17 19:56:04,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:56:04,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:56:04,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:56:04,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:56:04,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,169 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-17 19:56:04,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:56:04,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:56:04,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:56:04,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:56:04,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (1/1) ... [2025-03-17 19:56:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:04,211 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-17 19:56:04,214 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-17 19:56:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:56:04,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:56:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:56:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:56:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:56:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:56:04,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:56:04,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:56:04,397 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 19:56:04,397 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:56:04,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:56:04,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:56:04,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:56:04 BoogieIcfgContainer [2025-03-17 19:56:04,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:56:04,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:56:04,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:56:04,409 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:56:04,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:04,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:56:03" (1/3) ... [2025-03-17 19:56:04,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50adf797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:56:04, skipping insertion in model container [2025-03-17 19:56:04,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:04,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:04" (2/3) ... [2025-03-17 19:56:04,412 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50adf797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:56:04, skipping insertion in model container [2025-03-17 19:56:04,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:04,412 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:56:04" (3/3) ... [2025-03-17 19:56:04,413 INFO L363 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2025-03-17 19:56:04,446 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:56:04,446 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:56:04,446 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:56:04,446 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:56:04,446 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:56:04,446 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:56:04,446 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:56:04,446 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:56:04,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:04,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 19:56:04,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:04,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:04,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:56:04,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:56:04,461 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:56:04,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:04,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 19:56:04,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:04,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:04,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:56:04,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:56:04,466 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" [2025-03-17 19:56:04,467 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-17 19:56:04,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash 43659, now seen corresponding path program 1 times [2025-03-17 19:56:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653473968] [2025-03-17 19:56:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:56:04,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:56:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:04,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:56:04,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:56:04,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2025-03-17 19:56:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829979566] [2025-03-17 19:56:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:04,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:56:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:56:04,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:56:04,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:56:04,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1353439, now seen corresponding path program 1 times [2025-03-17 19:56:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243656657] [2025-03-17 19:56:04,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:04,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:04,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:04,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:04,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:04,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:04,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:04,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:04,827 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:04,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:04,827 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:04,827 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:04,828 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:04,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:04,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:04,828 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:04,828 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration1_Lasso [2025-03-17 19:56:04,828 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:04,828 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:04,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:04,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:05,193 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:05,196 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:05,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,199 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-17 19:56:05,200 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-17 19:56:05,202 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-17 19:56:05,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:05,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:05,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:05,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,227 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-17 19:56:05,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,259 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-17 19:56:05,260 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-17 19:56:05,261 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-17 19:56:05,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,282 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-17 19:56:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,285 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-17 19:56:05,286 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-17 19:56:05,291 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-17 19:56:05,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:05,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:05,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:05,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,311 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-17 19:56:05,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,314 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-17 19:56:05,316 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-17 19:56:05,318 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-17 19:56:05,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,342 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-17 19:56:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,347 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-17 19:56:05,347 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-17 19:56:05,349 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-17 19:56:05,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:05,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,373 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-17 19:56:05,375 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-17 19:56:05,376 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-17 19:56:05,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,399 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-17 19:56:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,401 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-17 19:56:05,403 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-17 19:56:05,404 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-17 19:56:05,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:05,426 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-17 19:56:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,428 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-17 19:56:05,429 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-17 19:56:05,430 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-17 19:56:05,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:05,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:05,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:05,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:05,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:05,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:05,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:05,493 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 19:56:05,495 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:56:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:05,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:05,499 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-17 19:56:05,501 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-17 19:56:05,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:05,514 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:05,514 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:05,514 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-17 19:56:05,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:05,537 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 19:56:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:56:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:56:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:05,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:56:05,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:05,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:56:05,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:56:05,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:05,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:56:05,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:05,594 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-17 19:56:05,610 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-17 19:56:05,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:05,631 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 18 transitions. Complement of second has 3 states. [2025-03-17 19:56:05,632 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-17 19:56:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-17 19:56:05,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 19:56:05,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:05,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 19:56:05,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:05,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:56:05,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:05,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-03-17 19:56:05,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 15 transitions. [2025-03-17 19:56:05,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:05,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:05,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2025-03-17 19:56:05,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:56:05,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 19:56:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2025-03-17 19:56:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-17 19:56:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-03-17 19:56:05,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:56:05,659 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:56:05,659 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:56:05,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-03-17 19:56:05,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:05,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:05,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:56:05,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:56:05,660 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 19:56:05,661 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume !true;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-17 19:56:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1353438, now seen corresponding path program 1 times [2025-03-17 19:56:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678819470] [2025-03-17 19:56:05,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:05,722 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-17 19:56:05,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678819470] [2025-03-17 19:56:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678819470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:56:05,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:56:05,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:56:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337869221] [2025-03-17 19:56:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:56:05,724 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:05,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 37697, now seen corresponding path program 1 times [2025-03-17 19:56:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961379884] [2025-03-17 19:56:05,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:56:05,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:56:05,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:05,732 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-17 19:56:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961379884] [2025-03-17 19:56:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961379884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:56:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:56:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:56:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124355757] [2025-03-17 19:56:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:56:05,732 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:56:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:05,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:56:05,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:56:05,736 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 7 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-17 19:56:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:05,740 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2025-03-17 19:56:05,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2025-03-17 19:56:05,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2025-03-17 19:56:05,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:05,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:56:05,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2025-03-17 19:56:05,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:56:05,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:56:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2025-03-17 19:56:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:56:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-17 19:56:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-17 19:56:05,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:56:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:56:05,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:56:05,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:56:05,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-17 19:56:05,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:05,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:05,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:56:05,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:56:05,746 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 19:56:05,746 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-17 19:56:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1353438, now seen corresponding path program 2 times [2025-03-17 19:56:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306127498] [2025-03-17 19:56:05,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:05,796 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-17 19:56:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306127498] [2025-03-17 19:56:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306127498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:56:05,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:56:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:56:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69967260] [2025-03-17 19:56:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:56:05,796 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1167740, now seen corresponding path program 1 times [2025-03-17 19:56:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656040560] [2025-03-17 19:56:05,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:05,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:56:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:56:05,850 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:05,858 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2025-03-17 19:56:05,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. [2025-03-17 19:56:05,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 12 transitions. [2025-03-17 19:56:05,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:05,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:56:05,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-17 19:56:05,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:56:05,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 19:56:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-17 19:56:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:56:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-17 19:56:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-17 19:56:05,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 19:56:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:56:05,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-17 19:56:05,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:56:05,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-17 19:56:05,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:56:05,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:05,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:05,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:56:05,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:56:05,861 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 19:56:05,861 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-17 19:56:05,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash 41956618, now seen corresponding path program 1 times [2025-03-17 19:56:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192943678] [2025-03-17 19:56:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:05,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:56:05,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:56:05,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:56:05,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:56:05,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1167740, now seen corresponding path program 2 times [2025-03-17 19:56:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706968392] [2025-03-17 19:56:05,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:05,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:05,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:05,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:05,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:05,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1376888315, now seen corresponding path program 1 times [2025-03-17 19:56:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371500454] [2025-03-17 19:56:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:05,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:56:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:56:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:05,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:56:05,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:56:05,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:05,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:05,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:06,031 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-17 19:56:06,186 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:06,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:06,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:06,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:06,186 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:06,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:06,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:06,187 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2025-03-17 19:56:06,187 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:06,187 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:06,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:06,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:06,500 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,502 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-17 19:56:06,504 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-17 19:56:06,505 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-17 19:56:06,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,526 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-17 19:56:06,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,528 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-17 19:56:06,530 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-17 19:56:06,531 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-17 19:56:06,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,548 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-17 19:56:06,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,550 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-17 19:56:06,551 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-17 19:56:06,554 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-17 19:56:06,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,572 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-17 19:56:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,574 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-17 19:56:06,575 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-17 19:56:06,575 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-17 19:56:06,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:56:06,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,594 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-17 19:56:06,596 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-17 19:56:06,597 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-17 19:56:06,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:56:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,621 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-17 19:56:06,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:56:06,622 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-17 19:56:06,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:56:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,644 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-17 19:56:06,645 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-17 19:56:06,646 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-17 19:56:06,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:56:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,670 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-17 19:56:06,671 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-17 19:56:06,672 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-17 19:56:06,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:56:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,690 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-17 19:56:06,691 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-17 19:56:06,692 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-17 19:56:06,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:06,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,714 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-17 19:56:06,714 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-17 19:56:06,715 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-17 19:56:06,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:06,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:06,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:06,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:56:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,733 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-17 19:56:06,734 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-17 19:56:06,735 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-17 19:56:06,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,760 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-17 19:56:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,762 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:56:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:56:06,763 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-17 19:56:06,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:56:06,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,786 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:56:06,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:56:06,789 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-17 19:56:06,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:06,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:06,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,815 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:56:06,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:56:06,818 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-17 19:56:06,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:06,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:06,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:06,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:06,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:06,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:06,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:06,852 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 19:56:06,852 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:56:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:06,855 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:56:06,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:56:06,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:06,868 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:06,868 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:06,868 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2025-03-17 19:56:06,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:06,880 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 19:56:06,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:06,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:56:06,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:56:06,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:06,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:56:06,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:06,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:56:06,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:56:06,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:06,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:56:06,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:06,932 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-17 19:56:06,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:56:06,932 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:06,947 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 19 transitions. Complement of second has 4 states. [2025-03-17 19:56:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-17 19:56:06,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:56:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 19:56:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-17 19:56:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:06,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2025-03-17 19:56:06,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:06,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 18 transitions. [2025-03-17 19:56:06,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:06,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:56:06,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-17 19:56:06,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:06,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-17 19:56:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-17 19:56:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-17 19:56:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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-17 19:56:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-17 19:56:06,951 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 19:56:06,951 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 19:56:06,951 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:56:06,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-17 19:56:06,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:06,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:06,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:06,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:56:06,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:06,952 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:06,952 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1300655166, now seen corresponding path program 1 times [2025-03-17 19:56:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345662984] [2025-03-17 19:56:06,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:06,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:56:06,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:56:06,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:06,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:06,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:56:06,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:56:06,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:06,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:06,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 1 times [2025-03-17 19:56:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339180249] [2025-03-17 19:56:06,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:06,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:06,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:06,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:06,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:06,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 94131581, now seen corresponding path program 1 times [2025-03-17 19:56:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045614304] [2025-03-17 19:56:06,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:06,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:56:06,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:56:06,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:06,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:06,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:56:07,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:56:07,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:07,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:07,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:07,216 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:07,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:07,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:07,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:07,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:07,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:07,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:07,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration5_Lasso [2025-03-17 19:56:07,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:07,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:07,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:07,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:07,538 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,544 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:56:07,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:56:07,546 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-17 19:56:07,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:07,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:07,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:07,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:07,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:56:07,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,567 INFO L229 MonitoredProcess]: Starting monitored process 27 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-17 19:56:07,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:56:07,569 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-17 19:56:07,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:07,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:07,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:07,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:07,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:56:07,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,588 INFO L229 MonitoredProcess]: Starting monitored process 28 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-17 19:56:07,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:56:07,590 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-17 19:56:07,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:07,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:07,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:07,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:07,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,612 INFO L229 MonitoredProcess]: Starting monitored process 29 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-17 19:56:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:56:07,613 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-17 19:56:07,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:07,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:07,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:07,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 19:56:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,643 INFO L229 MonitoredProcess]: Starting monitored process 30 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-17 19:56:07,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:56:07,644 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-17 19:56:07,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:07,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:07,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:07,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 19:56:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,666 INFO L229 MonitoredProcess]: Starting monitored process 31 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-17 19:56:07,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:56:07,668 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-17 19:56:07,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:07,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:07,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:07,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:07,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:07,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:07,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:07,688 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:56:07,688 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:56:07,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,690 INFO L229 MonitoredProcess]: Starting monitored process 32 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-17 19:56:07,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:56:07,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:07,703 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:07,703 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:07,703 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2 Supporting invariants [] [2025-03-17 19:56:07,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:07,714 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 19:56:07,719 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:07,720 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:07,720 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:07,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:56:07,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:56:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:07,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:56:07,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:07,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:07,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:07,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:07,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:07,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:07,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:07,810 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-17 19:56:07,811 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-17 19:56:07,811 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:07,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 9 states. [2025-03-17 19:56:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2025-03-17 19:56:07,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 19:56:07,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:07,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-17 19:56:07,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:07,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 19:56:07,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:07,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2025-03-17 19:56:07,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:07,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 21 transitions. [2025-03-17 19:56:07,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:07,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:07,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2025-03-17 19:56:07,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:07,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-17 19:56:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2025-03-17 19:56:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-17 19:56:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-17 19:56:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-17 19:56:07,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 19:56:07,855 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 19:56:07,855 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:56:07,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-03-17 19:56:07,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:07,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:07,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:07,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:56:07,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:07,857 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:07,857 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:07,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash 266135203, now seen corresponding path program 2 times [2025-03-17 19:56:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140896547] [2025-03-17 19:56:07,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:07,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:56:07,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:56:07,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:07,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:07,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140896547] [2025-03-17 19:56:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140896547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899116849] [2025-03-17 19:56:07,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:07,946 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:07,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-17 19:56:07,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:56:07,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:56:07,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:07,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:56:07,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:08,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899116849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:08,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 19:56:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306610431] [2025-03-17 19:56:08,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:08,071 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 2 times [2025-03-17 19:56:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173785832] [2025-03-17 19:56:08,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:08,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:08,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:08,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:08,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:08,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:08,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:56:08,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:56:08,114 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 9 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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-17 19:56:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:08,147 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-17 19:56:08,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2025-03-17 19:56:08,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:08,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2025-03-17 19:56:08,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:08,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:08,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2025-03-17 19:56:08,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:08,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-17 19:56:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2025-03-17 19:56:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 19:56:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) 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-17 19:56:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-17 19:56:08,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-17 19:56:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:56:08,153 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-17 19:56:08,153 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:56:08,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-17 19:56:08,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:08,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:08,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:08,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:56:08,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:08,154 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:08,154 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 578298831, now seen corresponding path program 3 times [2025-03-17 19:56:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051864688] [2025-03-17 19:56:08,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:08,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 2 equivalence classes. [2025-03-17 19:56:08,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:56:08,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:56:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:56:08,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:56:08,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 3 times [2025-03-17 19:56:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974838521] [2025-03-17 19:56:08,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:08,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:08,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:08,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:56:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:08,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:08,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1694395598, now seen corresponding path program 1 times [2025-03-17 19:56:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281645525] [2025-03-17 19:56:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:08,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:56:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:56:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:56:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:56:08,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:08,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:08,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:56:08,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:56:08,487 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:08,487 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:08,487 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:08,487 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:08,487 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:08,487 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,487 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:08,487 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:08,487 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration7_Lasso [2025-03-17 19:56:08,487 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:08,487 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:08,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:08,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:08,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:08,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,800 INFO L229 MonitoredProcess]: Starting monitored process 34 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-17 19:56:08,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:56:08,802 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-17 19:56:08,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:08,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:08,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:08,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:08,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:08,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:08,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:08,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:56:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,823 INFO L229 MonitoredProcess]: Starting monitored process 35 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-17 19:56:08,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:56:08,825 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-17 19:56:08,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:08,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:08,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:08,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:08,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:08,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:08,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:08,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:56:08,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,848 INFO L229 MonitoredProcess]: Starting monitored process 36 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-17 19:56:08,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:56:08,851 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-17 19:56:08,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:08,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:08,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:08,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:08,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:08,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:08,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:08,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 19:56:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,873 INFO L229 MonitoredProcess]: Starting monitored process 37 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-17 19:56:08,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:56:08,875 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-17 19:56:08,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:08,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:08,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:08,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:08,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:08,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:08,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:08,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:56:08,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,903 INFO L229 MonitoredProcess]: Starting monitored process 38 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-17 19:56:08,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 19:56:08,907 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-17 19:56:08,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:08,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:08,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:08,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:08,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:08,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:08,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:08,934 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 19:56:08,934 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:56:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:08,936 INFO L229 MonitoredProcess]: Starting monitored process 39 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-17 19:56:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 19:56:08,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:08,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:08,948 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:08,948 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 4)_1 Supporting invariants [] [2025-03-17 19:56:08,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:08,962 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 19:56:08,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:08,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:08,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:08,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:08,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:56:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:56:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:08,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:08,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,097 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-17 19:56:09,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:56:09,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Result 17 states and 23 transitions. Complement of second has 5 states. [2025-03-17 19:56:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:09,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:56:09,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:09,121 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:09,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:56:09,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:56:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,249 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-17 19:56:09,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:56:09,249 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Result 17 states and 23 transitions. Complement of second has 5 states. [2025-03-17 19:56:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:09,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:56:09,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:09,272 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:56:09,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:56:09,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,394 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-17 19:56:09,395 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:56:09,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Result 31 states and 40 transitions. Complement of second has 11 states. [2025-03-17 19:56:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-17 19:56:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-03-17 19:56:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:56:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 19:56:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:09,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:56:09,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:09,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2025-03-17 19:56:09,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:09,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 33 transitions. [2025-03-17 19:56:09,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:09,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:09,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2025-03-17 19:56:09,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:09,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-17 19:56:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2025-03-17 19:56:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-03-17 19:56:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-17 19:56:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-17 19:56:09,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-17 19:56:09,468 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-17 19:56:09,468 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:56:09,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2025-03-17 19:56:09,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:09,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:09,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:09,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:56:09,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:09,469 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:09,469 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash 521563572, now seen corresponding path program 4 times [2025-03-17 19:56:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:09,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029697989] [2025-03-17 19:56:09,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:09,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:56:09,479 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:56:09,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:09,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029697989] [2025-03-17 19:56:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029697989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813311457] [2025-03-17 19:56:09,548 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:09,551 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-17 19:56:09,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:56:09,599 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:56:09,599 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:09,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:56:09,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:09,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813311457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:09,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 19:56:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281267751] [2025-03-17 19:56:09,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:09,691 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:09,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 4 times [2025-03-17 19:56:09,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120237048] [2025-03-17 19:56:09,691 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:09,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:56:09,697 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:09,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:09,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:09,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:56:09,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:56:09,729 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 11 Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-17 19:56:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:09,770 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-17 19:56:09,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2025-03-17 19:56:09,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:09,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 28 transitions. [2025-03-17 19:56:09,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:09,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:09,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2025-03-17 19:56:09,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:09,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-17 19:56:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2025-03-17 19:56:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-17 19:56:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-17 19:56:09,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-17 19:56:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:56:09,775 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-17 19:56:09,775 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:56:09,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2025-03-17 19:56:09,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:09,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:09,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:09,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:56:09,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:09,775 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:09,775 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -670135288, now seen corresponding path program 5 times [2025-03-17 19:56:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094438784] [2025-03-17 19:56:09,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:09,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 3 equivalence classes. [2025-03-17 19:56:09,785 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:56:09,786 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 19:56:09,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:09,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:56:09,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:56:09,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:09,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 5 times [2025-03-17 19:56:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669142937] [2025-03-17 19:56:09,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:09,801 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,802 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,802 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:09,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:09,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:09,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:09,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 245082823, now seen corresponding path program 2 times [2025-03-17 19:56:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943461809] [2025-03-17 19:56:09,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:09,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:56:09,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:56:09,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:09,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:56:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:56:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:09,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:09,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:10,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 19:56:10,165 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:10,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:10,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:10,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:10,165 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:10,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:10,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:10,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration9_Lasso [2025-03-17 19:56:10,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:10,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:10,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:10,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:10,551 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,553 INFO L229 MonitoredProcess]: Starting monitored process 41 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-17 19:56:10,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:56:10,555 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-17 19:56:10,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:10,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:10,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:10,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:10,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:10,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:10,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:10,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:10,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,572 INFO L229 MonitoredProcess]: Starting monitored process 42 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-17 19:56:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:56:10,574 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-17 19:56:10,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:10,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:10,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:10,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:10,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:10,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:10,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:10,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-17 19:56:10,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,598 INFO L229 MonitoredProcess]: Starting monitored process 43 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-17 19:56:10,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:56:10,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:56:10,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:10,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:10,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:10,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:10,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:10,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:10,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:10,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:10,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,628 INFO L229 MonitoredProcess]: Starting monitored process 44 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-17 19:56:10,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:56:10,632 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-17 19:56:10,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:10,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:10,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:10,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:10,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:10,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:10,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:10,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:10,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,656 INFO L229 MonitoredProcess]: Starting monitored process 45 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-17 19:56:10,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:56:10,660 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-17 19:56:10,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:10,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:10,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:10,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:10,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:10,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:10,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:10,690 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:56:10,690 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:56:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:10,694 INFO L229 MonitoredProcess]: Starting monitored process 46 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-17 19:56:10,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 19:56:10,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:10,706 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:10,707 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:10,707 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 8))_1 Supporting invariants [] [2025-03-17 19:56:10,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:10,724 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 19:56:10,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:10,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:10,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:10,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:56:10,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:56:10,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:10,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:10,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:56:10,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:10,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:10,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:10,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:10,853 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-17 19:56:10,853 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:56:10,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:10,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 30 transitions. Complement of second has 5 states. [2025-03-17 19:56:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:10,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-17 19:56:10,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:10,875 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:10,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:10,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:56:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:56:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:10,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:56:10,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:10,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:10,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:10,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:10,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:10,997 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-17 19:56:10,998 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:56:10,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:11,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 30 transitions. Complement of second has 5 states. [2025-03-17 19:56:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:11,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-17 19:56:11,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:11,021 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:56:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:56:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:11,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:56:11,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:11,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:11,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:11,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:11,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:11,150 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-17 19:56:11,151 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:56:11,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:11,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 49 transitions. Complement of second has 13 states. [2025-03-17 19:56:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2025-03-17 19:56:11,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-17 19:56:11,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:11,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 19:56:11,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:11,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-17 19:56:11,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:11,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2025-03-17 19:56:11,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:11,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2025-03-17 19:56:11,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:11,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2025-03-17 19:56:11,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:11,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-17 19:56:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2025-03-17 19:56:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-03-17 19:56:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 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-17 19:56:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-17 19:56:11,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-17 19:56:11,228 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-17 19:56:11,228 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:56:11,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2025-03-17 19:56:11,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:11,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:11,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:11,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-17 19:56:11,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:11,229 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:11,229 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash -698609299, now seen corresponding path program 6 times [2025-03-17 19:56:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259913267] [2025-03-17 19:56:11,229 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:11,238 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 4 equivalence classes. [2025-03-17 19:56:11,245 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:56:11,246 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 19:56:11,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259913267] [2025-03-17 19:56:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259913267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711477413] [2025-03-17 19:56:11,330 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:11,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:11,332 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:11,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-17 19:56:11,375 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 4 equivalence classes. [2025-03-17 19:56:11,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:56:11,386 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-17 19:56:11,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:11,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:56:11,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:11,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711477413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:11,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 19:56:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792669828] [2025-03-17 19:56:11,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:11,514 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:11,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 6 times [2025-03-17 19:56:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:11,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825461966] [2025-03-17 19:56:11,514 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:11,519 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:11,520 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:11,520 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:56:11,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:11,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:11,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:56:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:56:11,548 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 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-17 19:56:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:11,597 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-03-17 19:56:11,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2025-03-17 19:56:11,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:11,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2025-03-17 19:56:11,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:11,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:11,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2025-03-17 19:56:11,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:11,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-17 19:56:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2025-03-17 19:56:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 19:56:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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-17 19:56:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-17 19:56:11,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-17 19:56:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:56:11,602 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-17 19:56:11,602 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:56:11,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2025-03-17 19:56:11,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:11,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:11,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:11,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1] [2025-03-17 19:56:11,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:11,603 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:11,603 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1189230695, now seen corresponding path program 7 times [2025-03-17 19:56:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360192913] [2025-03-17 19:56:11,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:56:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:56:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:11,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:56:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:56:11,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:11,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 7 times [2025-03-17 19:56:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:11,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855847914] [2025-03-17 19:56:11,627 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:11,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:11,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:11,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:11,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:11,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -389396968, now seen corresponding path program 3 times [2025-03-17 19:56:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414309790] [2025-03-17 19:56:11,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:11,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 4 equivalence classes. [2025-03-17 19:56:11,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:56:11,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:56:11,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:11,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:56:11,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:56:11,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:11,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:11,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 19:56:12,145 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:12,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:12,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:12,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:12,145 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:12,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:12,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:12,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration11_Lasso [2025-03-17 19:56:12,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:12,145 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:12,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:12,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:12,493 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:12,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,495 INFO L229 MonitoredProcess]: Starting monitored process 48 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-17 19:56:12,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 19:56:12,496 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-17 19:56:12,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 19:56:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,514 INFO L229 MonitoredProcess]: Starting monitored process 49 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-17 19:56:12,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 19:56:12,515 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-17 19:56:12,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 19:56:12,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,533 INFO L229 MonitoredProcess]: Starting monitored process 50 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-17 19:56:12,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 19:56:12,535 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-17 19:56:12,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 19:56:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,576 INFO L229 MonitoredProcess]: Starting monitored process 51 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-17 19:56:12,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 19:56:12,577 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-17 19:56:12,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 19:56:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,597 INFO L229 MonitoredProcess]: Starting monitored process 52 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-17 19:56:12,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-17 19:56:12,598 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-17 19:56:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 19:56:12,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,618 INFO L229 MonitoredProcess]: Starting monitored process 53 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-17 19:56:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 19:56:12,619 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-17 19:56:12,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 19:56:12,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,637 INFO L229 MonitoredProcess]: Starting monitored process 54 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-17 19:56:12,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 19:56:12,639 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-17 19:56:12,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 19:56:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,658 INFO L229 MonitoredProcess]: Starting monitored process 55 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-17 19:56:12,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 19:56:12,659 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-17 19:56:12,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,677 INFO L229 MonitoredProcess]: Starting monitored process 56 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-17 19:56:12,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 19:56:12,678 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-17 19:56:12,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 19:56:12,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,697 INFO L229 MonitoredProcess]: Starting monitored process 57 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-17 19:56:12,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 19:56:12,699 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-17 19:56:12,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 19:56:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,718 INFO L229 MonitoredProcess]: Starting monitored process 58 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-17 19:56:12,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 19:56:12,719 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-17 19:56:12,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 19:56:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,737 INFO L229 MonitoredProcess]: Starting monitored process 59 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-17 19:56:12,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 19:56:12,740 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-17 19:56:12,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 19:56:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,758 INFO L229 MonitoredProcess]: Starting monitored process 60 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-17 19:56:12,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 19:56:12,760 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-17 19:56:12,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 19:56:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,780 INFO L229 MonitoredProcess]: Starting monitored process 61 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-17 19:56:12,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 19:56:12,782 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-17 19:56:12,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,800 INFO L229 MonitoredProcess]: Starting monitored process 62 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-17 19:56:12,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 19:56:12,802 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-17 19:56:12,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-17 19:56:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,824 INFO L229 MonitoredProcess]: Starting monitored process 63 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-17 19:56:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 19:56:12,825 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-17 19:56:12,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 19:56:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,843 INFO L229 MonitoredProcess]: Starting monitored process 64 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-17 19:56:12,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 19:56:12,845 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-17 19:56:12,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 19:56:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,863 INFO L229 MonitoredProcess]: Starting monitored process 65 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-17 19:56:12,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 19:56:12,864 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-17 19:56:12,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 19:56:12,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,886 INFO L229 MonitoredProcess]: Starting monitored process 66 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-17 19:56:12,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 19:56:12,888 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-17 19:56:12,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 19:56:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,906 INFO L229 MonitoredProcess]: Starting monitored process 67 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-17 19:56:12,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 19:56:12,908 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-17 19:56:12,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:12,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:12,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:12,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 19:56:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,926 INFO L229 MonitoredProcess]: Starting monitored process 68 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-17 19:56:12,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 19:56:12,927 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-17 19:56:12,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 19:56:12,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,947 INFO L229 MonitoredProcess]: Starting monitored process 69 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-17 19:56:12,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 19:56:12,949 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-17 19:56:12,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,972 INFO L229 MonitoredProcess]: Starting monitored process 70 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-17 19:56:12,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 19:56:12,974 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-17 19:56:12,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:12,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:12,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:12,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:12,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:12,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:12,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:12,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 19:56:12,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:12,999 INFO L229 MonitoredProcess]: Starting monitored process 71 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-17 19:56:13,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 19:56:13,000 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-17 19:56:13,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:13,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:13,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:13,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:13,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:13,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:13,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:13,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 19:56:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:13,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:13,022 INFO L229 MonitoredProcess]: Starting monitored process 72 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-17 19:56:13,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 19:56:13,024 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-17 19:56:13,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:13,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:13,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:13,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:13,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:13,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:13,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:13,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 19:56:13,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:13,046 INFO L229 MonitoredProcess]: Starting monitored process 73 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-17 19:56:13,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 19:56:13,047 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-17 19:56:13,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:13,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:13,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:13,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:13,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:13,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:13,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:13,067 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:56:13,067 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:56:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:13,069 INFO L229 MonitoredProcess]: Starting monitored process 74 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-17 19:56:13,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 19:56:13,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:13,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:13,085 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:13,085 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1 Supporting invariants [] [2025-03-17 19:56:13,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 19:56:13,100 INFO L156 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 19:56:13,103 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:13,103 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:13,103 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:13,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:13,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:56:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:56:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:13,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,241 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-17 19:56:13,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-17 19:56:13,242 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13 Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 29 states and 37 transitions. Complement of second has 5 states. [2025-03-17 19:56:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:13,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-17 19:56:13,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:13,263 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:13,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:13,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:56:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:56:13,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:13,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:13,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,404 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-17 19:56:13,404 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-17 19:56:13,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13 Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,425 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 29 states and 37 transitions. Complement of second has 5 states. [2025-03-17 19:56:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:13,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-17 19:56:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:13,426 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:56:13,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:56:13,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:13,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:13,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:13,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 19:56:13,598 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-17 19:56:13,599 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-17 19:56:13,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13 Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 13. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 45 states and 58 transitions. Complement of second has 15 states. [2025-03-17 19:56:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-17 19:56:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2025-03-17 19:56:13,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-17 19:56:13,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:13,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 23 letters. Loop has 2 letters. [2025-03-17 19:56:13,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:13,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 21 letters. Loop has 4 letters. [2025-03-17 19:56:13,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:13,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2025-03-17 19:56:13,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:13,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 40 states and 51 transitions. [2025-03-17 19:56:13,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:13,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2025-03-17 19:56:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:13,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2025-03-17 19:56:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2025-03-17 19:56:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2025-03-17 19:56:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 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-17 19:56:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-17 19:56:13,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-17 19:56:13,676 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-17 19:56:13,676 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:56:13,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2025-03-17 19:56:13,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:13,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:13,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:13,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 19:56:13,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:13,677 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:13,677 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -548332418, now seen corresponding path program 8 times [2025-03-17 19:56:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735227126] [2025-03-17 19:56:13,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:13,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 19:56:13,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:56:13,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735227126] [2025-03-17 19:56:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735227126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355439718] [2025-03-17 19:56:13,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:13,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:13,800 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:13,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-03-17 19:56:13,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 19:56:13,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:56:13,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:13,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:56:13,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:13,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355439718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:13,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-17 19:56:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679957354] [2025-03-17 19:56:13,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:13,997 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 8 times [2025-03-17 19:56:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328533080] [2025-03-17 19:56:13,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:14,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:14,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:14,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:14,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:14,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:14,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:14,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:14,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:56:14,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:56:14,031 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 15 Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 19 states have internal predecessors, (50), 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-17 19:56:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:14,094 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-03-17 19:56:14,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 67 transitions. [2025-03-17 19:56:14,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:14,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 34 states and 42 transitions. [2025-03-17 19:56:14,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:14,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:14,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2025-03-17 19:56:14,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:14,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-17 19:56:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2025-03-17 19:56:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 19:56:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-17 19:56:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-17 19:56:14,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-17 19:56:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:56:14,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-17 19:56:14,099 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:56:14,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2025-03-17 19:56:14,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:14,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:14,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:14,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 19:56:14,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:14,099 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:14,099 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1782997458, now seen corresponding path program 9 times [2025-03-17 19:56:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103623365] [2025-03-17 19:56:14,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:14,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-17 19:56:14,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:56:14,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 19:56:14,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:14,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:56:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:56:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 9 times [2025-03-17 19:56:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942896947] [2025-03-17 19:56:14,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:14,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:14,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:14,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:56:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:14,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:14,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:14,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash -231393775, now seen corresponding path program 4 times [2025-03-17 19:56:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:14,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959926722] [2025-03-17 19:56:14,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:14,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:14,140 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-17 19:56:14,151 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:56:14,151 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:14,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:14,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:56:14,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:56:14,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:14,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:14,830 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:14,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:14,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:14,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:14,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:14,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:14,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:14,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:14,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration13_Lasso [2025-03-17 19:56:14,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:14,830 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:14,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:14,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:15,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:15,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:15,216 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:15,216 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,218 INFO L229 MonitoredProcess]: Starting monitored process 76 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-17 19:56:15,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 19:56:15,219 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-17 19:56:15,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 19:56:15,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,236 INFO L229 MonitoredProcess]: Starting monitored process 77 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-17 19:56:15,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 19:56:15,238 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-17 19:56:15,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,256 INFO L229 MonitoredProcess]: Starting monitored process 78 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-17 19:56:15,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 19:56:15,258 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-17 19:56:15,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 19:56:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,276 INFO L229 MonitoredProcess]: Starting monitored process 79 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-17 19:56:15,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 19:56:15,277 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-17 19:56:15,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-17 19:56:15,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,300 INFO L229 MonitoredProcess]: Starting monitored process 80 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-17 19:56:15,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-17 19:56:15,302 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-17 19:56:15,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-17 19:56:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,323 INFO L229 MonitoredProcess]: Starting monitored process 81 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-17 19:56:15,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 19:56:15,324 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-17 19:56:15,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 19:56:15,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,343 INFO L229 MonitoredProcess]: Starting monitored process 82 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-17 19:56:15,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 19:56:15,344 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-17 19:56:15,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 19:56:15,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,363 INFO L229 MonitoredProcess]: Starting monitored process 83 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-17 19:56:15,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 19:56:15,365 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-17 19:56:15,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 19:56:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,386 INFO L229 MonitoredProcess]: Starting monitored process 84 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-17 19:56:15,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 19:56:15,388 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-17 19:56:15,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,406 INFO L229 MonitoredProcess]: Starting monitored process 85 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-17 19:56:15,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 19:56:15,408 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-17 19:56:15,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-17 19:56:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,430 INFO L229 MonitoredProcess]: Starting monitored process 86 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-17 19:56:15,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-17 19:56:15,431 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-17 19:56:15,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-17 19:56:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,450 INFO L229 MonitoredProcess]: Starting monitored process 87 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-17 19:56:15,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-17 19:56:15,451 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-17 19:56:15,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 19:56:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,470 INFO L229 MonitoredProcess]: Starting monitored process 88 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-17 19:56:15,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-17 19:56:15,472 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-17 19:56:15,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-17 19:56:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,489 INFO L229 MonitoredProcess]: Starting monitored process 89 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-17 19:56:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-17 19:56:15,491 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-17 19:56:15,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-17 19:56:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,510 INFO L229 MonitoredProcess]: Starting monitored process 90 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-17 19:56:15,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-17 19:56:15,511 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-17 19:56:15,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-17 19:56:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,529 INFO L229 MonitoredProcess]: Starting monitored process 91 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-17 19:56:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-17 19:56:15,531 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-17 19:56:15,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-17 19:56:15,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,549 INFO L229 MonitoredProcess]: Starting monitored process 92 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-17 19:56:15,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-17 19:56:15,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-17 19:56:15,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:15,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:15,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:15,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-17 19:56:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,569 INFO L229 MonitoredProcess]: Starting monitored process 93 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-17 19:56:15,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-17 19:56:15,570 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-17 19:56:15,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-17 19:56:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,593 INFO L229 MonitoredProcess]: Starting monitored process 94 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-17 19:56:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-17 19:56:15,596 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-17 19:56:15,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:15,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:15,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,621 INFO L229 MonitoredProcess]: Starting monitored process 95 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-17 19:56:15,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 19:56:15,623 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-17 19:56:15,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:15,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:15,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:15,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:15,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:15,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:15,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:15,644 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:56:15,644 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:56:15,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:15,646 INFO L229 MonitoredProcess]: Starting monitored process 96 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-17 19:56:15,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 19:56:15,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:15,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:15,658 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:15,658 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 16)_1 Supporting invariants [] [2025-03-17 19:56:15,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:15,674 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:56:15,677 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:15,677 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:15,677 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:15,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:15,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:56:15,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:56:15,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:15,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:15,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 19:56:15,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:15,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:15,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:15,894 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-17 19:56:15,894 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-17 19:56:15,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:15,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 5 states. [2025-03-17 19:56:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:15,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2025-03-17 19:56:15,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:15,917 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:15,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:56:15,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:56:15,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:15,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:15,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 19:56:15,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:16,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:16,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:16,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:16,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:16,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:16,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:16,124 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-17 19:56:16,124 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-17 19:56:16,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:16,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 5 states. [2025-03-17 19:56:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:16,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2025-03-17 19:56:16,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:16,148 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:16,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:56:16,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:56:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:16,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 19:56:16,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:16,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:16,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:16,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:16,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:16,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:16,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:16,355 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-17 19:56:16,356 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-17 19:56:16,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:16,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 15. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 52 states and 67 transitions. Complement of second has 17 states. [2025-03-17 19:56:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-17 19:56:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2025-03-17 19:56:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 26 letters. Loop has 2 letters. [2025-03-17 19:56:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-17 19:56:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:16,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 26 letters. Loop has 4 letters. [2025-03-17 19:56:16,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:16,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2025-03-17 19:56:16,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:16,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 60 transitions. [2025-03-17 19:56:16,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:16,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:16,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2025-03-17 19:56:16,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:16,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-17 19:56:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2025-03-17 19:56:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2025-03-17 19:56:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 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-17 19:56:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-17 19:56:16,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-17 19:56:16,465 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-17 19:56:16,465 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:56:16,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2025-03-17 19:56:16,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:16,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:16,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:16,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2025-03-17 19:56:16,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:16,466 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:16,466 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 968880695, now seen corresponding path program 10 times [2025-03-17 19:56:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533638223] [2025-03-17 19:56:16,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:16,471 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:56:16,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:56:16,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:16,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:16,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-17 19:56:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533638223] [2025-03-17 19:56:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533638223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544899301] [2025-03-17 19:56:16,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:16,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:16,644 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:16,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-03-17 19:56:16,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 19:56:16,703 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:56:16,703 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:16,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:16,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:56:16,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:16,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544899301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:16,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-17 19:56:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441365904] [2025-03-17 19:56:16,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:16,879 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 10 times [2025-03-17 19:56:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99779926] [2025-03-17 19:56:16,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:16,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:56:16,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:16,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:16,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:16,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:16,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:16,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:16,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:56:16,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:56:16,918 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 17 Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 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-17 19:56:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:16,979 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-17 19:56:16,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2025-03-17 19:56:16,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:16,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 40 states and 49 transitions. [2025-03-17 19:56:16,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:16,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:16,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-03-17 19:56:16,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:16,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-17 19:56:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-03-17 19:56:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 19:56:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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-17 19:56:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-17 19:56:16,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-17 19:56:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:56:16,982 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-17 19:56:16,982 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:56:16,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2025-03-17 19:56:16,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:16,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:16,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:16,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 1, 1, 1, 1] [2025-03-17 19:56:16,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:16,983 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:16,983 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1918574237, now seen corresponding path program 11 times [2025-03-17 19:56:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:16,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273010031] [2025-03-17 19:56:16,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:16,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 6 equivalence classes. [2025-03-17 19:56:16,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:56:16,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-17 19:56:16,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:16,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:16,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:56:17,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:56:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:17,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:17,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 11 times [2025-03-17 19:56:17,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143116706] [2025-03-17 19:56:17,006 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:17,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:17,011 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:17,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:17,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:17,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:17,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:17,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:17,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:17,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:17,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1208871582, now seen corresponding path program 5 times [2025-03-17 19:56:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551756949] [2025-03-17 19:56:17,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:17,021 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-03-17 19:56:17,032 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:56:17,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-17 19:56:17,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:17,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:56:17,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:56:17,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:17,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:18,891 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:18,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:18,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:18,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:18,891 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:18,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:18,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:18,891 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:18,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration15_Lasso [2025-03-17 19:56:18,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:18,892 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:18,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:19,461 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:19,461 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:19,463 INFO L229 MonitoredProcess]: Starting monitored process 98 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-17 19:56:19,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-17 19:56:19,464 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-17 19:56:19,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:19,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:19,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:19,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:19,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:19,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:19,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:19,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-17 19:56:19,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:19,486 INFO L229 MonitoredProcess]: Starting monitored process 99 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-17 19:56:19,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-17 19:56:19,487 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-17 19:56:19,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:19,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:19,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:19,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:19,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:19,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:19,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:19,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:19,510 INFO L229 MonitoredProcess]: Starting monitored process 100 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-17 19:56:19,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-17 19:56:19,511 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-17 19:56:19,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:19,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:19,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:19,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:19,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:19,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:19,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:19,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-17 19:56:19,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:19,532 INFO L229 MonitoredProcess]: Starting monitored process 101 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-17 19:56:19,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 19:56:19,533 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-17 19:56:19,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:19,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:19,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:19,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:19,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:19,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:19,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:19,552 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:56:19,552 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:56:19,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:19,554 INFO L229 MonitoredProcess]: Starting monitored process 102 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-17 19:56:19,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-17 19:56:19,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:19,564 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:19,564 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:19,564 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1 Supporting invariants [] [2025-03-17 19:56:19,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 19:56:19,591 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 19:56:19,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:19,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:19,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:19,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:56:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:56:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:19,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:19,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:19,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:19,760 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-17 19:56:19,760 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:56:19,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:19,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 5 states. [2025-03-17 19:56:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:19,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-17 19:56:19,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:19,786 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:19,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:56:19,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:56:19,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:19,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:19,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:19,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:19,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:19,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:19,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:19,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:19,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:19,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:19,958 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-17 19:56:19,959 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:56:19,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:19,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 5 states. [2025-03-17 19:56:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:19,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-17 19:56:19,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:19,985 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:56:20,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:56:20,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:20,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:20,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:20,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:20,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:20,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:20,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:20,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:20,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:20,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:20,181 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-17 19:56:20,181 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:56:20,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:20,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 17. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 76 transitions. Complement of second has 19 states. [2025-03-17 19:56:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2025-03-17 19:56:20,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-17 19:56:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:20,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 33 letters. Loop has 2 letters. [2025-03-17 19:56:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:20,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 31 letters. Loop has 4 letters. [2025-03-17 19:56:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:20,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2025-03-17 19:56:20,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:20,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 54 states and 69 transitions. [2025-03-17 19:56:20,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:20,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:20,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2025-03-17 19:56:20,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:20,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-17 19:56:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2025-03-17 19:56:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-03-17 19:56:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 44 states have internal predecessors, (55), 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-17 19:56:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-03-17 19:56:20,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-17 19:56:20,318 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-03-17 19:56:20,318 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:56:20,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2025-03-17 19:56:20,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:20,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:20,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:20,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1] [2025-03-17 19:56:20,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:20,318 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:20,318 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:20,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2084421304, now seen corresponding path program 12 times [2025-03-17 19:56:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167283145] [2025-03-17 19:56:20,321 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:20,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:20,327 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 7 equivalence classes. [2025-03-17 19:56:20,342 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:56:20,342 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 19:56:20,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:20,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167283145] [2025-03-17 19:56:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167283145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502203511] [2025-03-17 19:56:20,540 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:20,542 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:20,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-03-17 19:56:20,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 7 equivalence classes. [2025-03-17 19:56:20,621 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:56:20,621 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 19:56:20,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:20,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:56:20,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:20,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502203511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:20,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-03-17 19:56:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957797111] [2025-03-17 19:56:20,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:20,870 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:20,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:20,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 12 times [2025-03-17 19:56:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895594724] [2025-03-17 19:56:20,871 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:20,874 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:20,875 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:20,875 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:56:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:20,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:20,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:20,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:20,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:56:20,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:56:20,909 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. cyclomatic complexity: 19 Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 25 states have internal predecessors, (68), 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-17 19:56:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:21,020 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2025-03-17 19:56:21,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 93 transitions. [2025-03-17 19:56:21,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:21,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 46 states and 56 transitions. [2025-03-17 19:56:21,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:21,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:21,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2025-03-17 19:56:21,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:21,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-17 19:56:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2025-03-17 19:56:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 19:56:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 45 states have internal predecessors, (56), 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-17 19:56:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-17 19:56:21,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-17 19:56:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:56:21,029 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-17 19:56:21,029 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 19:56:21,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2025-03-17 19:56:21,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:21,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:21,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:21,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 1, 1, 1, 1] [2025-03-17 19:56:21,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:21,031 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:21,031 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 531623324, now seen corresponding path program 13 times [2025-03-17 19:56:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595645722] [2025-03-17 19:56:21,034 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:21,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:56:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:56:21,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:21,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:56:21,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:56:21,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:21,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:21,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 13 times [2025-03-17 19:56:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135416536] [2025-03-17 19:56:21,064 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:21,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:21,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:21,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -211093669, now seen corresponding path program 6 times [2025-03-17 19:56:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097438592] [2025-03-17 19:56:21,069 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:21,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 7 equivalence classes. [2025-03-17 19:56:21,090 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:56:21,090 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 19:56:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:21,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:56:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:56:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:21,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:22,721 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:22,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:22,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:22,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:22,721 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:22,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:22,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:22,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:22,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration17_Lasso [2025-03-17 19:56:22,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:22,721 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:22,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:22,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:23,254 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:23,254 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,256 INFO L229 MonitoredProcess]: Starting monitored process 104 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-17 19:56:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-17 19:56:23,258 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-17 19:56:23,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-17 19:56:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,276 INFO L229 MonitoredProcess]: Starting monitored process 105 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-17 19:56:23,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-17 19:56:23,278 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-17 19:56:23,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-17 19:56:23,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,295 INFO L229 MonitoredProcess]: Starting monitored process 106 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-17 19:56:23,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-17 19:56:23,297 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-17 19:56:23,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-17 19:56:23,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,314 INFO L229 MonitoredProcess]: Starting monitored process 107 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-17 19:56:23,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-17 19:56:23,316 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-17 19:56:23,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:23,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:23,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-17 19:56:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,335 INFO L229 MonitoredProcess]: Starting monitored process 108 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-17 19:56:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-17 19:56:23,337 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-17 19:56:23,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,354 INFO L229 MonitoredProcess]: Starting monitored process 109 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-17 19:56:23,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-17 19:56:23,355 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-17 19:56:23,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:23,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,372 INFO L229 MonitoredProcess]: Starting monitored process 110 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-17 19:56:23,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-17 19:56:23,373 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-17 19:56:23,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-17 19:56:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,391 INFO L229 MonitoredProcess]: Starting monitored process 111 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-17 19:56:23,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-17 19:56:23,392 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-17 19:56:23,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-17 19:56:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,410 INFO L229 MonitoredProcess]: Starting monitored process 112 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-17 19:56:23,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-17 19:56:23,411 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-17 19:56:23,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:23,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:23,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:23,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:23,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,427 INFO L229 MonitoredProcess]: Starting monitored process 113 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-17 19:56:23,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-17 19:56:23,429 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-17 19:56:23,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:23,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:23,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-17 19:56:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,449 INFO L229 MonitoredProcess]: Starting monitored process 114 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-17 19:56:23,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-17 19:56:23,451 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-17 19:56:23,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:23,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:23,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:23,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-17 19:56:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,473 INFO L229 MonitoredProcess]: Starting monitored process 115 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-17 19:56:23,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-17 19:56:23,475 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-17 19:56:23,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:23,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:23,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:23,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:23,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:23,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:23,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:23,498 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:56:23,498 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:56:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:23,499 INFO L229 MonitoredProcess]: Starting monitored process 116 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-17 19:56:23,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-17 19:56:23,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:23,511 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:23,511 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:23,511 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1 Supporting invariants [] [2025-03-17 19:56:23,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-17 19:56:23,537 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-03-17 19:56:23,540 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:23,540 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:23,540 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:23,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:23,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:56:23,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:56:23,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:23,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:23,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:56:23,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:23,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:23,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:23,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:23,767 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-17 19:56:23,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 19:56:23,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:23,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 47 states and 58 transitions. Complement of second has 5 states. [2025-03-17 19:56:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-17 19:56:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:23,791 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:56:23,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:56:23,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:23,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:23,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:56:23,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:23,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:23,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:23,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:23,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:23,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:23,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:23,981 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-17 19:56:23,981 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 19:56:23,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:24,011 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 47 states and 58 transitions. Complement of second has 5 states. [2025-03-17 19:56:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-17 19:56:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:24,013 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:24,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:24,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:56:24,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:56:24,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:24,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:56:24,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:24,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:24,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:24,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:24,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:24,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:24,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:24,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:24,240 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-17 19:56:24,240 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 19:56:24,240 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:24,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 19. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 66 states and 85 transitions. Complement of second has 21 states. [2025-03-17 19:56:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-17 19:56:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2025-03-17 19:56:24,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-17 19:56:24,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:24,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-17 19:56:24,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:24,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 36 letters. Loop has 4 letters. [2025-03-17 19:56:24,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:24,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2025-03-17 19:56:24,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:24,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 78 transitions. [2025-03-17 19:56:24,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:24,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:24,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 78 transitions. [2025-03-17 19:56:24,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:24,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-03-17 19:56:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 78 transitions. [2025-03-17 19:56:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2025-03-17 19:56:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 50 states have internal predecessors, (62), 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-17 19:56:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-17 19:56:24,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-17 19:56:24,392 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-17 19:56:24,392 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 19:56:24,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2025-03-17 19:56:24,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:24,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:24,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:24,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2025-03-17 19:56:24,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:24,396 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:24,396 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash -997553919, now seen corresponding path program 14 times [2025-03-17 19:56:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:24,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652540304] [2025-03-17 19:56:24,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:24,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 19:56:24,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:56:24,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:24,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 66 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652540304] [2025-03-17 19:56:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652540304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243608215] [2025-03-17 19:56:24,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:24,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:24,607 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:24,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-03-17 19:56:24,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 19:56:24,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:56:24,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:24,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:24,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:56:24,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:24,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243608215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:24,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-03-17 19:56:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543592930] [2025-03-17 19:56:24,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:24,968 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 14 times [2025-03-17 19:56:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899064169] [2025-03-17 19:56:24,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:24,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:24,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:24,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:24,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:24,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:24,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:24,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:24,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:24,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:25,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:56:25,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:56:25,000 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 21 Second operand has 28 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 28 states have internal predecessors, (77), 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-17 19:56:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:25,104 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2025-03-17 19:56:25,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 106 transitions. [2025-03-17 19:56:25,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:25,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 52 states and 63 transitions. [2025-03-17 19:56:25,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:25,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:25,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2025-03-17 19:56:25,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:25,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 19:56:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2025-03-17 19:56:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 19:56:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 51 states have internal predecessors, (63), 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-17 19:56:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-17 19:56:25,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 19:56:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:56:25,110 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 19:56:25,110 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 19:56:25,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2025-03-17 19:56:25,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:25,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:25,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:25,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 1, 1, 1, 1] [2025-03-17 19:56:25,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:25,111 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:25,111 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1516277459, now seen corresponding path program 15 times [2025-03-17 19:56:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718257820] [2025-03-17 19:56:25,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:25,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 8 equivalence classes. [2025-03-17 19:56:25,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:56:25,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:56:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:25,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:56:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:56:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:25,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 15 times [2025-03-17 19:56:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249005246] [2025-03-17 19:56:25,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:25,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:25,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:25,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:56:25,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:25,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1148724564, now seen corresponding path program 7 times [2025-03-17 19:56:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081968366] [2025-03-17 19:56:25,150 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:25,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 19:56:25,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 19:56:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:25,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 19:56:25,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 19:56:25,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:25,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:25,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:27,314 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:27,315 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:27,315 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:27,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:27,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:27,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:27,315 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:27,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration19_Lasso [2025-03-17 19:56:27,315 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:27,315 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:27,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:27,819 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:27,819 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,825 INFO L229 MonitoredProcess]: Starting monitored process 118 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-17 19:56:27,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-17 19:56:27,826 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-17 19:56:27,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 19:56:27,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,845 INFO L229 MonitoredProcess]: Starting monitored process 119 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-17 19:56:27,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-17 19:56:27,847 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-17 19:56:27,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-17 19:56:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,868 INFO L229 MonitoredProcess]: Starting monitored process 120 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-17 19:56:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-17 19:56:27,869 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-17 19:56:27,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-17 19:56:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,891 INFO L229 MonitoredProcess]: Starting monitored process 121 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-17 19:56:27,905 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-17 19:56:27,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-17 19:56:27,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-17 19:56:27,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,928 INFO L229 MonitoredProcess]: Starting monitored process 122 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-17 19:56:27,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-17 19:56:27,929 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-17 19:56:27,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-17 19:56:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,951 INFO L229 MonitoredProcess]: Starting monitored process 123 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-17 19:56:27,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-17 19:56:27,952 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-17 19:56:27,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-17 19:56:27,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,972 INFO L229 MonitoredProcess]: Starting monitored process 124 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-17 19:56:27,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-17 19:56:27,974 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-17 19:56:27,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:27,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:27,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:27,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:27,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:27,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:27,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:27,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:27,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:27,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:27,996 INFO L229 MonitoredProcess]: Starting monitored process 125 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-17 19:56:27,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 19:56:27,997 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-17 19:56:28,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:28,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:28,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:28,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:28,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:28,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:28,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:28,017 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:56:28,017 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:56:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:28,019 INFO L229 MonitoredProcess]: Starting monitored process 126 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-17 19:56:28,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-17 19:56:28,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:28,031 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:28,031 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:28,031 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 28)_1 Supporting invariants [] [2025-03-17 19:56:28,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-03-17 19:56:28,051 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-03-17 19:56:28,053 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:28,053 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:28,053 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:28,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:56:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:56:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:28,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:56:28,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:28,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:28,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:28,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:28,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:28,351 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-17 19:56:28,351 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-17 19:56:28,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:28,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 53 states and 65 transitions. Complement of second has 5 states. [2025-03-17 19:56:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:28,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 19:56:28,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:28,378 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:56:28,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:56:28,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:28,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:28,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:56:28,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:28,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:28,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:28,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:28,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:28,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:28,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:28,693 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-17 19:56:28,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-17 19:56:28,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:28,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 53 states and 65 transitions. Complement of second has 5 states. [2025-03-17 19:56:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:28,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 19:56:28,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:28,728 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:28,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 19:56:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 19:56:28,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:28,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:28,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:56:28,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:29,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:29,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:29,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:29,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:29,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:29,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:29,101 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-17 19:56:29,101 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-17 19:56:29,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:29,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-17 19:56:29,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 21. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 73 states and 94 transitions. Complement of second has 23 states. [2025-03-17 19:56:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-17 19:56:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2025-03-17 19:56:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 19:56:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 43 letters. Loop has 2 letters. [2025-03-17 19:56:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:29,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 41 letters. Loop has 4 letters. [2025-03-17 19:56:29,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:29,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 94 transitions. [2025-03-17 19:56:29,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:29,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 87 transitions. [2025-03-17 19:56:29,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:29,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:29,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 87 transitions. [2025-03-17 19:56:29,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:29,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 87 transitions. [2025-03-17 19:56:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 87 transitions. [2025-03-17 19:56:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2025-03-17 19:56:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 56 states have internal predecessors, (69), 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-17 19:56:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-03-17 19:56:29,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-03-17 19:56:29,284 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-03-17 19:56:29,284 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 19:56:29,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 69 transitions. [2025-03-17 19:56:29,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:29,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:29,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:29,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1] [2025-03-17 19:56:29,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:29,285 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:29,285 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash -117711854, now seen corresponding path program 16 times [2025-03-17 19:56:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933053248] [2025-03-17 19:56:29,286 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:29,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-17 19:56:29,297 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 19:56:29,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:29,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 91 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933053248] [2025-03-17 19:56:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933053248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715294578] [2025-03-17 19:56:29,506 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:29,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:29,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:29,507 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:29,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-03-17 19:56:29,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-17 19:56:29,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 19:56:29,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:29,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:29,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:56:29,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:29,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715294578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:29,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2025-03-17 19:56:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401495949] [2025-03-17 19:56:29,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:29,892 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:29,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 16 times [2025-03-17 19:56:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:29,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934647331] [2025-03-17 19:56:29,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:29,895 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:56:29,896 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:29,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:29,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:29,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:29,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:29,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:29,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:29,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:29,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:56:29,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:56:29,925 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. cyclomatic complexity: 23 Second operand has 30 states, 29 states have (on average 2.896551724137931) internal successors, (84), 30 states have internal predecessors, (84), 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-17 19:56:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:30,052 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2025-03-17 19:56:30,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 119 transitions. [2025-03-17 19:56:30,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:30,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 58 states and 70 transitions. [2025-03-17 19:56:30,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:30,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:30,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 70 transitions. [2025-03-17 19:56:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:30,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-03-17 19:56:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 70 transitions. [2025-03-17 19:56:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 19:56:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.206896551724138) internal successors, (70), 57 states have internal predecessors, (70), 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-17 19:56:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-03-17 19:56:30,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-03-17 19:56:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 19:56:30,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-03-17 19:56:30,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 19:56:30,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 70 transitions. [2025-03-17 19:56:30,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:30,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:30,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:30,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 1, 1, 1, 1] [2025-03-17 19:56:30,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:30,061 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:30,061 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:30,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash -741527706, now seen corresponding path program 17 times [2025-03-17 19:56:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040759329] [2025-03-17 19:56:30,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:30,068 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 9 equivalence classes. [2025-03-17 19:56:30,084 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:56:30,084 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-17 19:56:30,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:30,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:56:30,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:56:30,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:30,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:30,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 17 times [2025-03-17 19:56:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815465070] [2025-03-17 19:56:30,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:30,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:30,107 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:30,107 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:30,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:30,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:30,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:30,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:30,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 356445861, now seen corresponding path program 8 times [2025-03-17 19:56:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077665839] [2025-03-17 19:56:30,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:30,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 19:56:30,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:56:30,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:30,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:30,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:56:30,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:56:30,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:30,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:35,289 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 300 DAG size of output: 223 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:56:35,425 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:35,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:35,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:35,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:35,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:35,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:35,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:35,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:35,426 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration21_Lasso [2025-03-17 19:56:35,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:35,426 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:35,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:35,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:36,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:36,191 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,193 INFO L229 MonitoredProcess]: Starting monitored process 128 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-17 19:56:36,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-17 19:56:36,195 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-17 19:56:36,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:36,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:36,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:36,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-17 19:56:36,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,215 INFO L229 MonitoredProcess]: Starting monitored process 129 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-17 19:56:36,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-17 19:56:36,216 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-17 19:56:36,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-17 19:56:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,236 INFO L229 MonitoredProcess]: Starting monitored process 130 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-17 19:56:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-17 19:56:36,238 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-17 19:56:36,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:36,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:36,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:36,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 19:56:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,255 INFO L229 MonitoredProcess]: Starting monitored process 131 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-17 19:56:36,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-17 19:56:36,257 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-17 19:56:36,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-17 19:56:36,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,283 INFO L229 MonitoredProcess]: Starting monitored process 132 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-17 19:56:36,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 19:56:36,285 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-17 19:56:36,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,306 INFO L229 MonitoredProcess]: Starting monitored process 133 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-17 19:56:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-17 19:56:36,309 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-17 19:56:36,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,335 INFO L229 MonitoredProcess]: Starting monitored process 134 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-17 19:56:36,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-17 19:56:36,338 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-17 19:56:36,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,361 INFO L229 MonitoredProcess]: Starting monitored process 135 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-17 19:56:36,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-17 19:56:36,363 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-17 19:56:36,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-17 19:56:36,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,387 INFO L229 MonitoredProcess]: Starting monitored process 136 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-17 19:56:36,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-17 19:56:36,390 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-17 19:56:36,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,414 INFO L229 MonitoredProcess]: Starting monitored process 137 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-17 19:56:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-17 19:56:36,417 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-17 19:56:36,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,441 INFO L229 MonitoredProcess]: Starting monitored process 138 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-17 19:56:36,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-17 19:56:36,443 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-17 19:56:36,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,467 INFO L229 MonitoredProcess]: Starting monitored process 139 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-17 19:56:36,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-17 19:56:36,470 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-17 19:56:36,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-03-17 19:56:36,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,493 INFO L229 MonitoredProcess]: Starting monitored process 140 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-17 19:56:36,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-17 19:56:36,496 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-17 19:56:36,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:36,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:36,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,520 INFO L229 MonitoredProcess]: Starting monitored process 141 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-17 19:56:36,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 19:56:36,521 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-17 19:56:36,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:36,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:36,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:36,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:36,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:36,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:36,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:36,541 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:56:36,541 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:56:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:36,543 INFO L229 MonitoredProcess]: Starting monitored process 142 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-17 19:56:36,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 19:56:36,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:36,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:36,555 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:36,555 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 32)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 32)_1 Supporting invariants [] [2025-03-17 19:56:36,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-17 19:56:36,582 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 19:56:36,584 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:36,584 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:36,584 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:36,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:56:36,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:56:36,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:36,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:36,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:56:36,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:36,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:36,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:36,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:36,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:36,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:36,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:36,921 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-17 19:56:36,922 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 19:56:36,922 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23 Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:36,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 59 states and 72 transitions. Complement of second has 5 states. [2025-03-17 19:56:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:36,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 46 letters. Loop has 2 letters. [2025-03-17 19:56:36,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:36,950 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:36,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:36,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:56:36,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:56:36,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:36,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:36,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:56:36,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:37,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:37,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:37,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:37,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:37,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:37,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:37,337 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-17 19:56:37,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 19:56:37,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23 Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:37,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 59 states and 72 transitions. Complement of second has 5 states. [2025-03-17 19:56:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:37,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 46 letters. Loop has 2 letters. [2025-03-17 19:56:37,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:37,365 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:37,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 19:56:37,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:56:37,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:37,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:37,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:56:37,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:37,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:37,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:37,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:37,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:37,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:37,712 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-17 19:56:37,712 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-17 19:56:37,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23 Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:37,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 70 transitions. cyclomatic complexity: 23. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 80 states and 103 transitions. Complement of second has 25 states. [2025-03-17 19:56:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-17 19:56:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 69 transitions. [2025-03-17 19:56:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 46 letters. Loop has 2 letters. [2025-03-17 19:56:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 48 letters. Loop has 2 letters. [2025-03-17 19:56:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 46 letters. Loop has 4 letters. [2025-03-17 19:56:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:37,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 103 transitions. [2025-03-17 19:56:37,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:37,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 75 states and 96 transitions. [2025-03-17 19:56:37,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:37,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:37,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2025-03-17 19:56:37,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:37,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-03-17 19:56:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2025-03-17 19:56:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-03-17 19:56:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 62 states have internal predecessors, (76), 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-17 19:56:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-03-17 19:56:37,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-03-17 19:56:37,899 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-03-17 19:56:37,902 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 19:56:37,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 76 transitions. [2025-03-17 19:56:37,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:37,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:37,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:37,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1] [2025-03-17 19:56:37,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:37,903 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:37,903 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:37,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1052912181, now seen corresponding path program 18 times [2025-03-17 19:56:37,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:37,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513314351] [2025-03-17 19:56:37,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:37,911 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 10 equivalence classes. [2025-03-17 19:56:37,927 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:56:37,929 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 19:56:37,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513314351] [2025-03-17 19:56:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513314351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637971458] [2025-03-17 19:56:38,177 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:38,179 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:38,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-03-17 19:56:38,286 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 10 equivalence classes. [2025-03-17 19:56:38,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:56:38,356 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 19:56:38,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:38,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:56:38,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 153 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:38,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 153 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637971458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:38,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-03-17 19:56:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569485231] [2025-03-17 19:56:38,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:38,800 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 18 times [2025-03-17 19:56:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512055599] [2025-03-17 19:56:38,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:56:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:38,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:38,803 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:38,803 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:56:38,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:38,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:38,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:38,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:38,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:38,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:38,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:38,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 19:56:38,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 19:56:38,836 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. cyclomatic complexity: 25 Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 34 states have internal predecessors, (95), 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-17 19:56:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:38,982 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-03-17 19:56:38,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 132 transitions. [2025-03-17 19:56:38,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:38,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 64 states and 77 transitions. [2025-03-17 19:56:38,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:38,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:38,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 77 transitions. [2025-03-17 19:56:38,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:38,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-17 19:56:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 77 transitions. [2025-03-17 19:56:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 19:56:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.203125) internal successors, (77), 63 states have internal predecessors, (77), 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-17 19:56:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-03-17 19:56:38,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-17 19:56:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:56:38,985 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-17 19:56:38,985 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 19:56:38,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 77 transitions. [2025-03-17 19:56:38,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:38,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:38,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:38,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 1, 1, 1, 1] [2025-03-17 19:56:38,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:38,985 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:38,986 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:38,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 849311479, now seen corresponding path program 19 times [2025-03-17 19:56:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28240247] [2025-03-17 19:56:38,986 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:56:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:56:39,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:39,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:39,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:56:39,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:56:39,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:39,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:39,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 19 times [2025-03-17 19:56:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:39,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693680738] [2025-03-17 19:56:39,019 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:56:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:39,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:39,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:39,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:39,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:39,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:39,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:39,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:39,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 144545270, now seen corresponding path program 9 times [2025-03-17 19:56:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950688527] [2025-03-17 19:56:39,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:39,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 10 equivalence classes. [2025-03-17 19:56:39,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 19:56:39,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 19:56:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:39,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 19:56:39,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 19:56:39,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:39,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:39,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:44,405 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 328 DAG size of output: 246 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:56:44,663 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:44,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:44,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:44,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:44,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:44,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:44,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:44,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:44,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration23_Lasso [2025-03-17 19:56:44,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:44,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:44,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:44,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:45,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:45,402 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:45,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,404 INFO L229 MonitoredProcess]: Starting monitored process 144 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-17 19:56:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-17 19:56:45,406 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-17 19:56:45,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:45,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:45,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:45,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-17 19:56:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,424 INFO L229 MonitoredProcess]: Starting monitored process 145 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-17 19:56:45,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-17 19:56:45,426 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-17 19:56:45,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:45,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,448 INFO L229 MonitoredProcess]: Starting monitored process 146 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-17 19:56:45,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-17 19:56:45,450 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-17 19:56:45,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-17 19:56:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,472 INFO L229 MonitoredProcess]: Starting monitored process 147 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-17 19:56:45,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-17 19:56:45,474 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-17 19:56:45,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-17 19:56:45,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,495 INFO L229 MonitoredProcess]: Starting monitored process 148 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-17 19:56:45,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-17 19:56:45,497 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-17 19:56:45,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-17 19:56:45,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,522 INFO L229 MonitoredProcess]: Starting monitored process 149 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-17 19:56:45,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 19:56:45,524 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-17 19:56:45,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-17 19:56:45,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,547 INFO L229 MonitoredProcess]: Starting monitored process 150 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-17 19:56:45,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-17 19:56:45,548 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-17 19:56:45,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:45,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-17 19:56:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,570 INFO L229 MonitoredProcess]: Starting monitored process 151 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-17 19:56:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-17 19:56:45,571 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-17 19:56:45,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:45,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:45,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:45,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:45,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:45,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:45,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:45,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:56:45,590 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:56:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:45,592 INFO L229 MonitoredProcess]: Starting monitored process 152 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-17 19:56:45,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-17 19:56:45,593 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:45,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:45,604 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:45,604 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1 Supporting invariants [] [2025-03-17 19:56:45,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-17 19:56:45,628 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-17 19:56:45,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:45,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:45,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:45,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:56:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:56:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:45,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:56:45,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:45,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:45,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:45,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:45,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:45,895 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-17 19:56:45,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 19:56:45,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:45,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 65 states and 79 transitions. Complement of second has 5 states. [2025-03-17 19:56:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:45,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 51 letters. Loop has 2 letters. [2025-03-17 19:56:45,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:45,927 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:45,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:56:45,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:56:45,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:45,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:45,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:56:45,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:46,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:46,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:46,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:46,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:46,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:46,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:46,204 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-17 19:56:46,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 19:56:46,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:46,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 65 states and 79 transitions. Complement of second has 5 states. [2025-03-17 19:56:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 51 letters. Loop has 2 letters. [2025-03-17 19:56:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:46,230 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:46,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:46,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 19:56:46,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:56:46,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:46,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:46,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:56:46,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:46,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:46,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:46,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:46,527 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-17 19:56:46,528 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 19:56:46,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:46,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 25. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 112 transitions. Complement of second has 27 states. [2025-03-17 19:56:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-17 19:56:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2025-03-17 19:56:46,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 51 letters. Loop has 2 letters. [2025-03-17 19:56:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 53 letters. Loop has 2 letters. [2025-03-17 19:56:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 51 letters. Loop has 4 letters. [2025-03-17 19:56:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:46,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 112 transitions. [2025-03-17 19:56:46,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:46,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 82 states and 105 transitions. [2025-03-17 19:56:46,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:46,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:46,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 105 transitions. [2025-03-17 19:56:46,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:46,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 105 transitions. [2025-03-17 19:56:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 105 transitions. [2025-03-17 19:56:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2025-03-17 19:56:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 68 states have internal predecessors, (83), 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-17 19:56:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-03-17 19:56:46,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-03-17 19:56:46,750 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-03-17 19:56:46,750 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 19:56:46,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2025-03-17 19:56:46,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:46,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:46,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:46,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 19:56:46,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:46,752 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:46,752 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:46,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1469050076, now seen corresponding path program 20 times [2025-03-17 19:56:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253216167] [2025-03-17 19:56:46,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:46,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-17 19:56:46,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:56:46,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:46,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 153 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253216167] [2025-03-17 19:56:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253216167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133017493] [2025-03-17 19:56:47,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:47,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:47,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:47,072 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:47,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-03-17 19:56:47,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-17 19:56:47,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 19:56:47,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:56:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:47,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 19:56:47,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 190 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:47,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 190 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:47,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133017493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:47,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:47,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-17 19:56:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837691152] [2025-03-17 19:56:47,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:47,688 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:47,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 20 times [2025-03-17 19:56:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832738294] [2025-03-17 19:56:47,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:56:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:47,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:47,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:47,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:47,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:47,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:47,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:47,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 19:56:47,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 19:56:47,720 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 27 Second operand has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 37 states have internal predecessors, (104), 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-17 19:56:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:47,882 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2025-03-17 19:56:47,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 145 transitions. [2025-03-17 19:56:47,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:47,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 70 states and 84 transitions. [2025-03-17 19:56:47,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:47,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:47,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 84 transitions. [2025-03-17 19:56:47,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:47,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-03-17 19:56:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 84 transitions. [2025-03-17 19:56:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 19:56:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2) internal successors, (84), 69 states have internal predecessors, (84), 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-17 19:56:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-03-17 19:56:47,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-03-17 19:56:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:56:47,885 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-03-17 19:56:47,885 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-17 19:56:47,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 84 transitions. [2025-03-17 19:56:47,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:47,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:47,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:47,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 19:56:47,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:47,885 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:47,885 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1574951120, now seen corresponding path program 21 times [2025-03-17 19:56:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432840127] [2025-03-17 19:56:47,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:47,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-17 19:56:47,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:56:47,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:56:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:47,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:56:47,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:56:47,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:47,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 21 times [2025-03-17 19:56:47,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884197008] [2025-03-17 19:56:47,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:56:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:47,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:47,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:47,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:56:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:47,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:47,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:47,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1699537937, now seen corresponding path program 10 times [2025-03-17 19:56:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024716927] [2025-03-17 19:56:47,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:47,968 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-17 19:56:47,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:56:47,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:47,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 19:56:47,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 19:56:47,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:47,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:55,161 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 356 DAG size of output: 266 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:56:55,429 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:56:55,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:56:55,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:56:55,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:56:55,429 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:56:55,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:55,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:56:55,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:56:55,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration25_Lasso [2025-03-17 19:56:55,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:56:55,429 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:56:55,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:55,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:56:56,317 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:56:56,318 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:56:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,319 INFO L229 MonitoredProcess]: Starting monitored process 154 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-17 19:56:56,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-17 19:56:56,321 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-17 19:56:56,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,341 INFO L229 MonitoredProcess]: Starting monitored process 155 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-17 19:56:56,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-17 19:56:56,342 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-17 19:56:56,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-17 19:56:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,362 INFO L229 MonitoredProcess]: Starting monitored process 156 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-17 19:56:56,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-17 19:56:56,363 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-17 19:56:56,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,384 INFO L229 MonitoredProcess]: Starting monitored process 157 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-17 19:56:56,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-17 19:56:56,386 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-17 19:56:56,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,404 INFO L229 MonitoredProcess]: Starting monitored process 158 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-17 19:56:56,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-17 19:56:56,406 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-17 19:56:56,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,425 INFO L229 MonitoredProcess]: Starting monitored process 159 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-17 19:56:56,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-17 19:56:56,426 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-17 19:56:56,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-17 19:56:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,445 INFO L229 MonitoredProcess]: Starting monitored process 160 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-17 19:56:56,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-17 19:56:56,446 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-17 19:56:56,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-17 19:56:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,464 INFO L229 MonitoredProcess]: Starting monitored process 161 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-17 19:56:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-17 19:56:56,466 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-17 19:56:56,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,484 INFO L229 MonitoredProcess]: Starting monitored process 162 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-17 19:56:56,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-17 19:56:56,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-17 19:56:56,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-17 19:56:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,504 INFO L229 MonitoredProcess]: Starting monitored process 163 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-17 19:56:56,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-17 19:56:56,506 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-17 19:56:56,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,524 INFO L229 MonitoredProcess]: Starting monitored process 164 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-17 19:56:56,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-17 19:56:56,526 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-17 19:56:56,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-03-17 19:56:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,544 INFO L229 MonitoredProcess]: Starting monitored process 165 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-17 19:56:56,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-17 19:56:56,546 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-17 19:56:56,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-17 19:56:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,566 INFO L229 MonitoredProcess]: Starting monitored process 166 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-17 19:56:56,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-17 19:56:56,568 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-17 19:56:56,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,589 INFO L229 MonitoredProcess]: Starting monitored process 167 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-17 19:56:56,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-17 19:56:56,591 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-17 19:56:56,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-17 19:56:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,610 INFO L229 MonitoredProcess]: Starting monitored process 168 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-17 19:56:56,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-17 19:56:56,612 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-17 19:56:56,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,634 INFO L229 MonitoredProcess]: Starting monitored process 169 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-17 19:56:56,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-17 19:56:56,636 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-17 19:56:56,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-03-17 19:56:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,654 INFO L229 MonitoredProcess]: Starting monitored process 170 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-17 19:56:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-17 19:56:56,656 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-17 19:56:56,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-03-17 19:56:56,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,675 INFO L229 MonitoredProcess]: Starting monitored process 171 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-17 19:56:56,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-17 19:56:56,677 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-17 19:56:56,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-17 19:56:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,698 INFO L229 MonitoredProcess]: Starting monitored process 172 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-17 19:56:56,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-17 19:56:56,699 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-17 19:56:56,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-03-17 19:56:56,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,718 INFO L229 MonitoredProcess]: Starting monitored process 173 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-17 19:56:56,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-17 19:56:56,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:56:56,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:56:56,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:56:56,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:56:56,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-17 19:56:56,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,738 INFO L229 MonitoredProcess]: Starting monitored process 174 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-17 19:56:56,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-17 19:56:56,740 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-17 19:56:56,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:56:56,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-17 19:56:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,762 INFO L229 MonitoredProcess]: Starting monitored process 175 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-17 19:56:56,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-03-17 19:56:56,764 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-17 19:56:56,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:56:56,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:56:56,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:56:56,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:56:56,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:56:56,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:56:56,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:56:56,785 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:56:56,785 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:56:56,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:56,788 INFO L229 MonitoredProcess]: Starting monitored process 176 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-17 19:56:56,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-03-17 19:56:56,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:56:56,801 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:56:56,801 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:56:56,801 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-17 19:56:56,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:56,831 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 19:56:56,840 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:56:56,840 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:56:56,840 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:56:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:56,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:56:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:56:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:56,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:56:56,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:57,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:57,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:57,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:57,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:57,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,134 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-17 19:56:57,134 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-17 19:56:57,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27 Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:57,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 71 states and 86 transitions. Complement of second has 5 states. [2025-03-17 19:56:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:57,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-17 19:56:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:57,163 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:56:57,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:56:57,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:57,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:56:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:57,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:57,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:57,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,486 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-17 19:56:57,487 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-17 19:56:57,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27 Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:57,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 71 states and 86 transitions. Complement of second has 5 states. [2025-03-17 19:56:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:56:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:56:57,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-17 19:56:57,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:57,514 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:56:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:57,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:56:57,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:56:57,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:57,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:57,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:56:57,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2025-03-17 19:56:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:57,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:57,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:57,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:56:57,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:57,851 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-17 19:56:57,852 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-17 19:56:57,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27 Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:58,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 84 transitions. cyclomatic complexity: 27. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 94 states and 121 transitions. Complement of second has 29 states. [2025-03-17 19:56:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:56:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-17 19:56:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 81 transitions. [2025-03-17 19:56:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-17 19:56:58,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:58,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 58 letters. Loop has 2 letters. [2025-03-17 19:56:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:58,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 56 letters. Loop has 4 letters. [2025-03-17 19:56:58,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:56:58,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 121 transitions. [2025-03-17 19:56:58,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:58,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 89 states and 114 transitions. [2025-03-17 19:56:58,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:56:58,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:56:58,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 114 transitions. [2025-03-17 19:56:58,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:58,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 114 transitions. [2025-03-17 19:56:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 114 transitions. [2025-03-17 19:56:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2025-03-17 19:56:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2) internal successors, (90), 74 states have internal predecessors, (90), 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-17 19:56:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-03-17 19:56:58,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-03-17 19:56:58,099 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-03-17 19:56:58,099 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-17 19:56:58,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 90 transitions. [2025-03-17 19:56:58,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:58,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:58,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:58,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 1, 1, 1, 1] [2025-03-17 19:56:58,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:58,099 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:58,100 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1168385899, now seen corresponding path program 22 times [2025-03-17 19:56:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892549608] [2025-03-17 19:56:58,100 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:58,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-17 19:56:58,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:56:58,115 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:58,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 190 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892549608] [2025-03-17 19:56:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892549608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:56:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853332918] [2025-03-17 19:56:58,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:58,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:58,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:58,437 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:56:58,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-03-17 19:56:58,535 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-17 19:56:58,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:56:58,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:58,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:58,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:56:58,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:56:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 231 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:58,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:56:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 231 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:56:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853332918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:56:59,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:56:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2025-03-17 19:56:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497666088] [2025-03-17 19:56:59,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:56:59,096 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:56:59,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 22 times [2025-03-17 19:56:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796035483] [2025-03-17 19:56:59,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:56:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:59,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:56:59,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:59,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:56:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:59,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:59,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:59,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:59,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:56:59,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 19:56:59,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 19:56:59,136 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. cyclomatic complexity: 29 Second operand has 39 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 39 states have internal predecessors, (111), 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-17 19:56:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:56:59,319 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2025-03-17 19:56:59,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 158 transitions. [2025-03-17 19:56:59,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:59,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 76 states and 91 transitions. [2025-03-17 19:56:59,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:56:59,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:56:59,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 91 transitions. [2025-03-17 19:56:59,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:56:59,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-03-17 19:56:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 91 transitions. [2025-03-17 19:56:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 19:56:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 75 states have internal predecessors, (91), 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-17 19:56:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2025-03-17 19:56:59,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-03-17 19:56:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 19:56:59,324 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-03-17 19:56:59,324 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-17 19:56:59,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 91 transitions. [2025-03-17 19:56:59,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:56:59,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:59,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:59,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 1, 1, 1, 1] [2025-03-17 19:56:59,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:56:59,325 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:56:59,325 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:56:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 305590977, now seen corresponding path program 23 times [2025-03-17 19:56:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751517231] [2025-03-17 19:56:59,326 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:59,332 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 12 equivalence classes. [2025-03-17 19:56:59,348 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:56:59,348 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-17 19:56:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:59,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:56:59,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:56:59,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:59,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 23 times [2025-03-17 19:56:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156918050] [2025-03-17 19:56:59,366 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:59,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:59,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:59,369 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:56:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:59,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:56:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:56:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:59,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1615152960, now seen corresponding path program 11 times [2025-03-17 19:56:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003723167] [2025-03-17 19:56:59,374 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:56:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:59,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 12 equivalence classes. [2025-03-17 19:56:59,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 19:56:59,396 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-17 19:56:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:59,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 19:56:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 19:56:59,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:59,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:09,046 WARN L286 SmtUtils]: Spent 9.60s on a formula simplification. DAG size of input: 384 DAG size of output: 286 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:57:09,441 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:09,441 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:09,441 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:09,441 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:09,441 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:09,441 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:09,441 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:09,441 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:09,441 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration27_Lasso [2025-03-17 19:57:09,441 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:09,441 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:09,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:09,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:10,422 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:10,422 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:10,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,424 INFO L229 MonitoredProcess]: Starting monitored process 178 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-17 19:57:10,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-17 19:57:10,427 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-17 19:57:10,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-17 19:57:10,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,445 INFO L229 MonitoredProcess]: Starting monitored process 179 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-17 19:57:10,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-17 19:57:10,446 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-17 19:57:10,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-17 19:57:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,465 INFO L229 MonitoredProcess]: Starting monitored process 180 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-17 19:57:10,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-17 19:57:10,467 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-17 19:57:10,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-17 19:57:10,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,487 INFO L229 MonitoredProcess]: Starting monitored process 181 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-17 19:57:10,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-17 19:57:10,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:10,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-17 19:57:10,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,507 INFO L229 MonitoredProcess]: Starting monitored process 182 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-17 19:57:10,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-17 19:57:10,508 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-17 19:57:10,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-17 19:57:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,529 INFO L229 MonitoredProcess]: Starting monitored process 183 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-17 19:57:10,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-17 19:57:10,530 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-17 19:57:10,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:10,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:10,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:10,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-17 19:57:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,548 INFO L229 MonitoredProcess]: Starting monitored process 184 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-17 19:57:10,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-17 19:57:10,563 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-17 19:57:10,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-17 19:57:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,584 INFO L229 MonitoredProcess]: Starting monitored process 185 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-17 19:57:10,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-17 19:57:10,585 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-17 19:57:10,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-03-17 19:57:10,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,606 INFO L229 MonitoredProcess]: Starting monitored process 186 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-17 19:57:10,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-17 19:57:10,608 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-17 19:57:10,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-17 19:57:10,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,629 INFO L229 MonitoredProcess]: Starting monitored process 187 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-17 19:57:10,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-17 19:57:10,630 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-17 19:57:10,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-03-17 19:57:10,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,652 INFO L229 MonitoredProcess]: Starting monitored process 188 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-17 19:57:10,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-17 19:57:10,654 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-17 19:57:10,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,678 INFO L229 MonitoredProcess]: Starting monitored process 189 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-17 19:57:10,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-17 19:57:10,680 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-17 19:57:10,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,701 INFO L229 MonitoredProcess]: Starting monitored process 190 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-17 19:57:10,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-17 19:57:10,703 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-17 19:57:10,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,728 INFO L229 MonitoredProcess]: Starting monitored process 191 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-17 19:57:10,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-17 19:57:10,730 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-17 19:57:10,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-17 19:57:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,753 INFO L229 MonitoredProcess]: Starting monitored process 192 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-17 19:57:10,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-17 19:57:10,758 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-17 19:57:10,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,783 INFO L229 MonitoredProcess]: Starting monitored process 193 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-17 19:57:10,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-17 19:57:10,785 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-17 19:57:10,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-17 19:57:10,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,807 INFO L229 MonitoredProcess]: Starting monitored process 194 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-17 19:57:10,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-03-17 19:57:10,809 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-17 19:57:10,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-03-17 19:57:10,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,865 INFO L229 MonitoredProcess]: Starting monitored process 195 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-17 19:57:10,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-03-17 19:57:10,867 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-17 19:57:10,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,890 INFO L229 MonitoredProcess]: Starting monitored process 196 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-17 19:57:10,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-03-17 19:57:10,892 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-17 19:57:10,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:10,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,915 INFO L229 MonitoredProcess]: Starting monitored process 197 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-17 19:57:10,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-03-17 19:57:10,916 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-17 19:57:10,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:10,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:10,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:10,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:10,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:10,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:10,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:10,936 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:57:10,936 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-17 19:57:10,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:10,938 INFO L229 MonitoredProcess]: Starting monitored process 198 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-17 19:57:10,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-17 19:57:10,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:10,949 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:10,949 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:10,949 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1 Supporting invariants [] [2025-03-17 19:57:10,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-03-17 19:57:10,977 INFO L156 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2025-03-17 19:57:10,980 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:57:10,980 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:57:10,980 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-17 19:57:10,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:57:11,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:57:11,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:11,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:11,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,298 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-17 19:57:11,299 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-17 19:57:11,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29 Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:11,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 93 transitions. Complement of second has 5 states. [2025-03-17 19:57:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:57:11,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 61 letters. Loop has 2 letters. [2025-03-17 19:57:11,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,327 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:57:11,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:57:11,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:57:11,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:11,667 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-17 19:57:11,667 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-17 19:57:11,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29 Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:11,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 93 transitions. Complement of second has 5 states. [2025-03-17 19:57:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 19:57:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 61 letters. Loop has 2 letters. [2025-03-17 19:57:11,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:11,696 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:57:11,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:11,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 19:57:11,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 19:57:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:11,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:57:11,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:12,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:12,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:12,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:12,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:12,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:12,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:12,046 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-17 19:57:12,046 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-17 19:57:12,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29 Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:12,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:12,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 91 transitions. cyclomatic complexity: 29. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 130 transitions. Complement of second has 31 states. [2025-03-17 19:57:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:57:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2025-03-17 19:57:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 61 letters. Loop has 2 letters. [2025-03-17 19:57:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 63 letters. Loop has 2 letters. [2025-03-17 19:57:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:12,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 61 letters. Loop has 4 letters. [2025-03-17 19:57:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:12,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 130 transitions. [2025-03-17 19:57:12,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:57:12,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 96 states and 123 transitions. [2025-03-17 19:57:12,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:57:12,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:57:12,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 123 transitions. [2025-03-17 19:57:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:12,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-03-17 19:57:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 123 transitions. [2025-03-17 19:57:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2025-03-17 19:57:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 80 states have internal predecessors, (97), 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-17 19:57:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2025-03-17 19:57:12,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 97 transitions. [2025-03-17 19:57:12,342 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 97 transitions. [2025-03-17 19:57:12,342 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-17 19:57:12,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 97 transitions. [2025-03-17 19:57:12,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:57:12,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:12,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:12,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 1, 1, 1, 1] [2025-03-17 19:57:12,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:57:12,342 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:57:12,343 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:57:12,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1678799782, now seen corresponding path program 24 times [2025-03-17 19:57:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628640704] [2025-03-17 19:57:12,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:12,351 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 13 equivalence classes. [2025-03-17 19:57:12,373 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 19:57:12,373 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 19:57:12,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 231 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628640704] [2025-03-17 19:57:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628640704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651343989] [2025-03-17 19:57:12,725 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:12,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:12,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:12,728 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:12,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2025-03-17 19:57:12,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 13 equivalence classes. [2025-03-17 19:57:13,110 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 19:57:13,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 19:57:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:57:13,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 276 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:13,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 276 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651343989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:13,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2025-03-17 19:57:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659628393] [2025-03-17 19:57:13,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:13,741 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:57:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 24 times [2025-03-17 19:57:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138494474] [2025-03-17 19:57:13,741 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,745 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:13,746 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:13,746 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:57:13,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:13,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:13,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:13,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 19:57:13,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 19:57:13,780 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. cyclomatic complexity: 31 Second operand has 43 states, 42 states have (on average 2.9047619047619047) internal successors, (122), 43 states have internal predecessors, (122), 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-17 19:57:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:13,940 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2025-03-17 19:57:13,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 171 transitions. [2025-03-17 19:57:13,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:57:13,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 82 states and 98 transitions. [2025-03-17 19:57:13,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:57:13,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:57:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 98 transitions. [2025-03-17 19:57:13,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:13,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-17 19:57:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 98 transitions. [2025-03-17 19:57:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 19:57:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 81 states have internal predecessors, (98), 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-17 19:57:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-03-17 19:57:13,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-17 19:57:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 19:57:13,943 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-17 19:57:13,943 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-17 19:57:13,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 98 transitions. [2025-03-17 19:57:13,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:57:13,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:13,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:13,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 12, 12, 12, 1, 1, 1, 1] [2025-03-17 19:57:13,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:57:13,944 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 19:57:13,944 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 19:57:13,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1714083066, now seen corresponding path program 25 times [2025-03-17 19:57:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539979865] [2025-03-17 19:57:13,945 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:57:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 19:57:13,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 19:57:13,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:13,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 19:57:13,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 19:57:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 25 times [2025-03-17 19:57:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527509306] [2025-03-17 19:57:13,990 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:57:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:13,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:13,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:13,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2033615047, now seen corresponding path program 12 times [2025-03-17 19:57:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708535036] [2025-03-17 19:57:13,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:57:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:14,003 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 13 equivalence classes. [2025-03-17 19:57:14,029 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:57:14,030 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 19:57:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:14,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 19:57:14,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 19:57:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:14,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:36,173 WARN L286 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 412 DAG size of output: 306 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:57:36,635 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:36,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:36,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:36,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:36,636 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:36,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:36,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:36,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:36,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration29_Lasso [2025-03-17 19:57:36,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:36,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:36,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:36,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:36,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:36,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:36,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:37,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true