./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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-15/array17_alloca.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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:55:50,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:55:50,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:55:50,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:55:50,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:55:50,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:55:50,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:55:50,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:55:50,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:55:50,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:55:50,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:55:50,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:55:50,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:55:50,165 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:55:50,165 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:55:50,165 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:55:50,165 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:55:50,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:55:50,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:55:50,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:55:50,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:55:50,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:55:50,168 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:55:50,168 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2025-03-09 06:55:50,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:55:50,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:55:50,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:55:50,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:55:50,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:55:50,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array17_alloca.i [2025-03-09 06:55:51,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaced8408/04e0d9f67d774900b6abc09d447a2f65/FLAG7fc06d960 [2025-03-09 06:55:51,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:55:51,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array17_alloca.i [2025-03-09 06:55:51,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaced8408/04e0d9f67d774900b6abc09d447a2f65/FLAG7fc06d960 [2025-03-09 06:55:52,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaced8408/04e0d9f67d774900b6abc09d447a2f65 [2025-03-09 06:55:52,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:55:52,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:55:52,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:52,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:55:52,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:55:52,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52, skipping insertion in model container [2025-03-09 06:55:52,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:55:52,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:52,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:55:52,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:52,399 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:55:52,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52 WrapperNode [2025-03-09 06:55:52,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:52,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:52,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:55:52,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:55:52,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,426 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-03-09 06:55:52,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:52,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:55:52,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:55:52,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:55:52,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,441 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-03-09 06:55:52,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:55:52,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:55:52,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:55:52,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:55:52,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (1/1) ... [2025-03-09 06:55:52,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:52,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:52,470 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-09 06:55:52,475 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-09 06:55:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:55:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:55:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:55:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:55:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:55:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:55:52,543 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:55:52,544 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:55:52,641 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: call ULTIMATE.dealloc(main_#t~malloc206#1.base, main_#t~malloc206#1.offset);havoc main_#t~malloc206#1.base, main_#t~malloc206#1.offset; [2025-03-09 06:55:52,646 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-09 06:55:52,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:55:52,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:55:52,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:55:52,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:52 BoogieIcfgContainer [2025-03-09 06:55:52,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:55:52,653 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:55:52,653 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:55:52,656 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:55:52,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:52,657 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:55:52" (1/3) ... [2025-03-09 06:55:52,658 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70386034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:52, skipping insertion in model container [2025-03-09 06:55:52,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:52,658 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:52" (2/3) ... [2025-03-09 06:55:52,658 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70386034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:52, skipping insertion in model container [2025-03-09 06:55:52,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:52,658 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:52" (3/3) ... [2025-03-09 06:55:52,659 INFO L363 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2025-03-09 06:55:52,693 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:55:52,693 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:55:52,693 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:55:52,694 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:55:52,694 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:55:52,694 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:55:52,694 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:55:52,695 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:55:52,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:52,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-09 06:55:52,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:52,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:52,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:55:52,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:52,716 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:55:52,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:52,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-09 06:55:52,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:52,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:52,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:55:52,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:52,722 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" [2025-03-09 06:55:52,723 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" [2025-03-09 06:55:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1685269753, now seen corresponding path program 1 times [2025-03-09 06:55:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520112011] [2025-03-09 06:55:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:52,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:52,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:52,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:52,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:52,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-09 06:55:52,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:52,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545667446] [2025-03-09 06:55:52,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:52,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:52,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:52,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:52,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:52,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:52,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:52,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 703754799, now seen corresponding path program 1 times [2025-03-09 06:55:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-03-09 06:55:52,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:52,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:52,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:52,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:52,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:52,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:53,178 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:53,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:53,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:53,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:53,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:53,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:53,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:53,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2025-03-09 06:55:53,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:53,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:53,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:53,564 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:53,566 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:53,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,570 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-09 06:55:53,571 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-09 06:55:53,573 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-09 06:55:53,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,600 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-09 06:55:53,601 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-09 06:55:53,602 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-09 06:55:53,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,621 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-09 06:55:53,622 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-09 06:55:53,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-09 06:55:53,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:55:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,648 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-09 06:55:53,650 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-09 06:55:53,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:53,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:55:53,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,677 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-09 06:55:53,678 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-09 06:55:53,681 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-09 06:55:53,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:55:53,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,703 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-09 06:55:53,704 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-09 06:55:53,705 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-09 06:55:53,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:55:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,724 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-09 06:55:53,725 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-09 06:55:53,726 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-09 06:55:53,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:55:53,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,747 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-09 06:55:53,748 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-09 06:55:53,748 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-09 06:55:53,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:55:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,770 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-09 06:55:53,772 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-09 06:55:53,773 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-09 06:55:53,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:53,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:53,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:53,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,790 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-09 06:55:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,793 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-09 06:55:53,794 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-09 06:55:53,796 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-09 06:55:53,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:53,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:53,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,820 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-09 06:55:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,822 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-09 06:55:53,823 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-09 06:55:53,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-09 06:55:53,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:53,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:53,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,845 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-09 06:55:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,847 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-09 06:55:53,848 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-09 06:55:53,849 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-09 06:55:53,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:53,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:53,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:53,872 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-09 06:55:53,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,874 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-09 06:55:53,875 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-09 06:55:53,877 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-09 06:55:53,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:53,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:53,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:53,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:53,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:53,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:53,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:53,939 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-09 06:55:53,941 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-09 06:55:53,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,944 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-09 06:55:53,946 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-09 06:55:53,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:53,958 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:53,958 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:53,959 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-09 06:55:53,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:53,977 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:55:53,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:54,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:54,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:54,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:55:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:54,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:54,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:54,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:54,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:55:54,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:54,037 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-09 06:55:54,054 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-09 06:55:54,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-09 06:55:54,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 24 transitions. Complement of second has 3 states. [2025-03-09 06:55:54,076 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-09 06:55:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-09 06:55:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2025-03-09 06:55:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-09 06:55:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 7 letters. Loop has 1 letters. [2025-03-09 06:55:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:55:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:54,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2025-03-09 06:55:54,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 15 transitions. [2025-03-09 06:55:54,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:54,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:55:54,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-09 06:55:54,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:54,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:55:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-09 06:55:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-09 06:55:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) 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-09 06:55:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-09 06:55:54,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-09 06:55:54,102 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-09 06:55:54,102 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:55:54,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-09 06:55:54,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:54,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:54,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:54,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:54,103 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" [2025-03-09 06:55:54,103 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:55:54,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash 703754798, now seen corresponding path program 1 times [2025-03-09 06:55:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491496747] [2025-03-09 06:55:54,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:54,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:54,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:54,179 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-09 06:55:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491496747] [2025-03-09 06:55:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491496747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:55:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:55:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:55:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921354458] [2025-03-09 06:55:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:55:54,181 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:54,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 1 times [2025-03-09 06:55:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148620224] [2025-03-09 06:55:54,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:54,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:55:54,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:55:54,255 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 06:55:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:54,291 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2025-03-09 06:55:54,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2025-03-09 06:55:54,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,292 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-09 06:55:54,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2025-03-09 06:55:54,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:54,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:55:54,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2025-03-09 06:55:54,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:54,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:55:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2025-03-09 06:55:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 06:55:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-09 06:55:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-03-09 06:55:54,294 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:55:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:55:54,295 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:55:54,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:55:54,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2025-03-09 06:55:54,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:54,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:54,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:54,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:54,296 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" [2025-03-09 06:55:54,296 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:55:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 341562296, now seen corresponding path program 1 times [2025-03-09 06:55:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688993180] [2025-03-09 06:55:54,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:55:54,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:55:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:55:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:55:54,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 2 times [2025-03-09 06:55:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957085190] [2025-03-09 06:55:54,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:54,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1823852150, now seen corresponding path program 1 times [2025-03-09 06:55:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513778187] [2025-03-09 06:55:54,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:54,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:54,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:54,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513778187] [2025-03-09 06:55:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513778187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139744140] [2025-03-09 06:55:54,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:54,438 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:54,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 06:55:54,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:54,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:54,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:55:54,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:54,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139744140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:54,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 06:55:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366670372] [2025-03-09 06:55:54,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:55:54,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:55:54,586 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-09 06:55:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:54,624 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-03-09 06:55:54,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-09 06:55:54,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 13 transitions. [2025-03-09 06:55:54,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:54,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:55:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-03-09 06:55:54,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:54,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-09 06:55:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-03-09 06:55:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 06:55:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-09 06:55:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-09 06:55:54,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-09 06:55:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:55:54,628 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-09 06:55:54,628 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:55:54,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-03-09 06:55:54,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:54,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:54,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:54,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:54,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:54,628 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" [2025-03-09 06:55:54,628 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:55:54,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1998496622, now seen corresponding path program 2 times [2025-03-09 06:55:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-03-09 06:55:54,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 06:55:54,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:55:54,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:55:54,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:55:54,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 3 times [2025-03-09 06:55:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173633355] [2025-03-09 06:55:54,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:55:54,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:54,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:54,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash 704872620, now seen corresponding path program 2 times [2025-03-09 06:55:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397873882] [2025-03-09 06:55:54,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:55:54,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:54,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:55:54,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:54,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,948 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:54,948 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:54,948 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:54,948 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:54,948 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:54,948 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,948 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:54,949 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:54,949 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2025-03-09 06:55:54,949 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:54,949 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:54,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,270 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:55,270 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,275 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-09 06:55:55,276 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-09 06:55:55,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-09 06:55:55,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,294 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-09 06:55:55,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,296 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-09 06:55:55,296 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-09 06:55:55,298 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-09 06:55:55,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,315 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-09 06:55:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,317 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-09 06:55:55,318 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-09 06:55:55,319 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-09 06:55:55,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:55,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:55,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:55:55,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,343 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-09 06:55:55,344 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-09 06:55:55,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-09 06:55:55,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:55,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:55,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:55,384 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:55:55,384 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:55:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,387 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-09 06:55:55,388 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-09 06:55:55,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:55,400 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:55:55,400 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:55,400 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 3*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 16*ULTIMATE.start_main_~j~0#1 Supporting invariants [-1*ULTIMATE.start_main_~length~0#1 + 2 >= 0] [2025-03-09 06:55:55,407 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-09 06:55:55,419 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-09 06:55:55,421 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:55:55,422 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:55:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:55:55,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:55:55,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:55,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:55:55,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:55,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:55,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:55:55,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:55,536 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-09 06:55:55,536 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-09 06:55:55,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 9 states. [2025-03-09 06:55:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 06:55:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2025-03-09 06:55:55,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 06:55:55,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-09 06:55:55,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-09 06:55:55,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-09 06:55:55,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:55,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-03-09 06:55:55,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:55:55,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:55:55,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-09 06:55:55,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:55,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-09 06:55:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-09 06:55:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-09 06:55:55,616 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-09 06:55:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-09 06:55:55,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:55:55,616 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:55:55,616 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:55:55,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-09 06:55:55,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:55,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:55,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:55,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:55,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:55,619 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" [2025-03-09 06:55:55,619 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:55:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1823853176, now seen corresponding path program 3 times [2025-03-09 06:55:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-03-09 06:55:55,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 3 equivalence classes. [2025-03-09 06:55:55,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:55,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:55:55,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:55,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:55,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 4 times [2025-03-09 06:55:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663324648] [2025-03-09 06:55:55,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:55:55,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:55,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:55,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:55,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 376245558, now seen corresponding path program 3 times [2025-03-09 06:55:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989205552] [2025-03-09 06:55:55,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 3 equivalence classes. [2025-03-09 06:55:55,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:55,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:55:55,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:55,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:55,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,019 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:56,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:56,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:56,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:56,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:56,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:56,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:56,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration5_Lasso [2025-03-09 06:55:56,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:56,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:56,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:56,405 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:56,405 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:56,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,407 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-09 06:55:56,408 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-09 06:55:56,409 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-09 06:55:56,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:56,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:56,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:56,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,426 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-09 06:55:56,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,428 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-09 06:55:56,428 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-09 06:55:56,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-09 06:55:56,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:56,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:56,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:56,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:55:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,447 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-09 06:55:56,448 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-09 06:55:56,449 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-09 06:55:56,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:56,495 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-09 06:55:56,495 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-03-09 06:55:56,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,498 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-09 06:55:56,500 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-09 06:55:56,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:56,511 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:56,512 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:56,512 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-09 06:55:56,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 06:55:56,530 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-09 06:55:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:56,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:56,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,583 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-09 06:55:56,583 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-09 06:55:56,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 31 transitions. Complement of second has 5 states. [2025-03-09 06:55:56,597 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-09 06:55:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-09 06:55:56,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-09 06:55:56,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:55:56,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 06:55:56,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2025-03-09 06:55:56,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 27 transitions. [2025-03-09 06:55:56,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:55:56,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:55:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2025-03-09 06:55:56,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:56,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:55:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2025-03-09 06:55:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2025-03-09 06:55:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-09 06:55:56,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:55:56,600 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:55:56,600 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:55:56,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-09 06:55:56,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:56,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:56,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:56,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:56,601 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1;" [2025-03-09 06:55:56,601 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:55:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash 704872621, now seen corresponding path program 1 times [2025-03-09 06:55:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-09 06:55:56,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:55:56,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:56,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606325637] [2025-03-09 06:55:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606325637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099323433] [2025-03-09 06:55:56,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:56,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,909 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 06:55:56,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:55:56,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:56,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:55:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-09 06:55:57,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:55:57,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-03-09 06:55:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:57,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:57,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:57,129 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-09 06:55:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-03-09 06:55:57,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:55:57,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 774 treesize of output 678 [2025-03-09 06:55:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099323433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:57,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-03-09 06:55:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53304178] [2025-03-09 06:55:57,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:57,527 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:57,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 5 times [2025-03-09 06:55:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389235275] [2025-03-09 06:55:57,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:55:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:57,531 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:57,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:57,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:57,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:57,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:57,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:57,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:57,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:57,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:55:57,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:55:57,589 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 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-09 06:56:19,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:56:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:19,752 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-03-09 06:56:19,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2025-03-09 06:56:19,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:19,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2025-03-09 06:56:19,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:56:19,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:19,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2025-03-09 06:56:19,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:19,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-09 06:56:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2025-03-09 06:56:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-09 06:56:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-09 06:56:19,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-09 06:56:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:56:19,757 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-09 06:56:19,757 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:56:19,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2025-03-09 06:56:19,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:19,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:19,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:19,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:19,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:19,758 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1;" [2025-03-09 06:56:19,758 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:56:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1222244757, now seen corresponding path program 1 times [2025-03-09 06:56:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-09 06:56:19,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:19,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:56:19,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:56:19,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:19,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-09 06:56:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143801541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550319165] [2025-03-09 06:56:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:19,836 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:19,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-09 06:56:19,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:56:19,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:56:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:19,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:56:19,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:19,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550319165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:19,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:19,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-09 06:56:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181878825] [2025-03-09 06:56:19,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:19,959 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 6 times [2025-03-09 06:56:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696577404] [2025-03-09 06:56:19,960 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:19,962 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:19,964 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:19,964 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:56:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:19,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:19,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:19,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:19,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:20,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:56:20,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:56:20,023 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 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-09 06:56:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:20,054 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-09 06:56:20,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2025-03-09 06:56:20,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:20,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 19 transitions. [2025-03-09 06:56:20,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:56:20,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:20,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2025-03-09 06:56:20,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:20,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-09 06:56:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2025-03-09 06:56:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 06:56:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-09 06:56:20,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-09 06:56:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:56:20,057 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-09 06:56:20,057 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:56:20,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2025-03-09 06:56:20,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:20,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:20,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:20,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:20,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:20,058 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1;" [2025-03-09 06:56:20,058 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:56:20,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 794728565, now seen corresponding path program 2 times [2025-03-09 06:56:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307228652] [2025-03-09 06:56:20,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:20,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:56:20,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:20,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:20,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307228652] [2025-03-09 06:56:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307228652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167359968] [2025-03-09 06:56:20,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:20,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:20,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:20,317 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:20,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-09 06:56:20,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:56:20,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:56:20,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:20,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:20,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:56:20,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:20,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:56:20,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-09 06:56:20,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:20,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-09 06:56:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:20,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:20,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2025-03-09 06:56:20,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:20,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 164 [2025-03-09 06:56:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167359968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:20,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2025-03-09 06:56:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718551382] [2025-03-09 06:56:20,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:20,717 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:20,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 7 times [2025-03-09 06:56:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:20,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335661952] [2025-03-09 06:56:20,717 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:20,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:20,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:20,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:20,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:20,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:20,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:56:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:56:20,784 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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-09 06:56:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:21,072 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-09 06:56:21,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-03-09 06:56:21,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:56:21,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 33 transitions. [2025-03-09 06:56:21,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-09 06:56:21,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-09 06:56:21,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2025-03-09 06:56:21,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:21,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-09 06:56:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2025-03-09 06:56:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-03-09 06:56:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-09 06:56:21,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-09 06:56:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:56:21,079 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-09 06:56:21,079 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:56:21,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2025-03-09 06:56:21,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:21,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:21,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:21,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:21,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:21,081 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1;" [2025-03-09 06:56:21,081 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:56:21,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 177504053, now seen corresponding path program 3 times [2025-03-09 06:56:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708700713] [2025-03-09 06:56:21,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:21,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-09 06:56:21,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:56:21,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:56:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708700713] [2025-03-09 06:56:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708700713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596563467] [2025-03-09 06:56:21,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:21,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:21,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,502 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:21,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-09 06:56:21,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-09 06:56:21,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:56:21,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:56:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:56:21,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:21,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:56:21,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-09 06:56:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:21,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:21,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 20 [2025-03-09 06:56:21,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:21,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2025-03-09 06:56:21,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-09 06:56:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:21,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:22,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2025-03-09 06:56:22,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:22,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24214 treesize of output 22806 [2025-03-09 06:56:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596563467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:22,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 28 [2025-03-09 06:56:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650804707] [2025-03-09 06:56:22,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:22,224 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 8 times [2025-03-09 06:56:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885248092] [2025-03-09 06:56:22,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:22,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:22,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:22,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:22,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:22,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:22,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:22,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:22,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 06:56:22,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-03-09 06:56:22,299 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 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-09 06:56:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:22,561 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-09 06:56:22,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2025-03-09 06:56:22,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:22,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 28 transitions. [2025-03-09 06:56:22,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:56:22,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-09 06:56:22,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-09 06:56:22,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:22,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-09 06:56:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-09 06:56:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2025-03-09 06:56:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-09 06:56:22,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-09 06:56:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:56:22,564 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-09 06:56:22,564 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:56:22,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2025-03-09 06:56:22,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:22,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:22,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:22,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:22,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:22,564 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1;" "assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume main_~i~0#1 < main_~length~0#1;main_#t~post208#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post208#1;call write~int#0(main_#t~post208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post208#1;main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1;" [2025-03-09 06:56:22,564 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4);" "assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-09 06:56:22,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 289736169, now seen corresponding path program 4 times [2025-03-09 06:56:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:22,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37169905] [2025-03-09 06:56:22,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:22,569 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 06:56:22,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:22,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:22,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37169905] [2025-03-09 06:56:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37169905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728905410] [2025-03-09 06:56:22,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:22,867 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-09 06:56:22,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 06:56:22,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:56:22,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:22,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:22,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:56:22,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:22,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-09 06:56:22,968 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-09 06:56:22,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2025-03-09 06:56:23,149 INFO L349 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2025-03-09 06:56:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 26 [2025-03-09 06:56:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:23,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:45,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-03-09 06:56:45,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:45,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 107 [2025-03-09 06:56:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:45,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728905410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:45,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:45,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-09 06:56:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274491777] [2025-03-09 06:56:45,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:45,185 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:45,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1151, now seen corresponding path program 9 times [2025-03-09 06:56:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061194568] [2025-03-09 06:56:45,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:45,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:45,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:45,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:56:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:45,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:45,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:45,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:45,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:45,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:45,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:45,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:56:45,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=367, Unknown=2, NotChecked=0, Total=462 [2025-03-09 06:56:45,242 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 6 Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 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-09 06:56:57,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:57:10,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:57:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:57:24,447 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-09 06:57:24,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2025-03-09 06:57:24,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:57:24,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-03-09 06:57:24,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:57:24,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:57:24,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:57:24,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:57:24,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:57:24,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:57:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:57:24,453 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:57:24,453 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:57:24,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:57:24,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:57:24,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:57:24,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:57:24 BoogieIcfgContainer [2025-03-09 06:57:24,458 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:57:24,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:57:24,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:57:24,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:57:24,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:52" (3/4) ... [2025-03-09 06:57:24,460 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:57:24,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:57:24,461 INFO L158 Benchmark]: Toolchain (without parser) took 92305.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.5MB in the beginning and 371.4MB in the end (delta: -260.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.63ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.43ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: Boogie Preprocessor took 18.66ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: IcfgBuilder took 205.81ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 78.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: BuchiAutomizer took 91805.43ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.2MB in the beginning and 371.5MB in the end (delta: -293.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:57:24,462 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 427.8MB. Free memory was 371.5MB in the beginning and 371.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:57:24,465 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.63ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 93.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.43ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.66ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 205.81ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 78.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 91805.43ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 78.2MB in the beginning and 371.5MB in the end (delta: -293.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 427.8MB. Free memory was 371.5MB in the beginning and 371.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + length) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 7 locations. One deterministic module has affine ranking function (((long) -1 * j) + length) and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 91.7s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 29.2s. Construction of modules took 26.6s. Büchi inclusion checks took 35.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 26.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 75 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital128 mio100 ax100 hnf100 lsp100 ukn86 mio100 lsp49 div141 bol100 ite100 ukn100 eq151 hnf93 smp81 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:57:24,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-09 06:57:24,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-09 06:57:24,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-09 06:57:25,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-09 06:57:25,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-09 06:57:25,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 06:57:25,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE