./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.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 a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:02:21,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:02:21,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:02:21,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:02:21,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:02:21,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:02:21,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:02:21,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:02:21,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:02:21,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:02:21,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:02:21,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:02:21,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:02:21,916 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:02:21,916 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:02:21,916 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:02:21,918 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:02:21,918 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:02:21,918 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:02:21,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:02:21,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:02:21,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:02:21,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:02:21,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:02:21,920 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:02:21,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:02:21,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:02:21,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:02:21,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:02:21,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:02:21,925 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:02:21,925 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2024-10-13 17:02:22,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:02:22,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:02:22,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:02:22,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:02:22,177 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:02:22,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-13 17:02:23,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:02:23,781 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:02:23,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-13 17:02:23,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6cae5694/4dd620ec5d4948d284746eea3d84bdab/FLAG36a451147 [2024-10-13 17:02:24,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6cae5694/4dd620ec5d4948d284746eea3d84bdab [2024-10-13 17:02:24,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:02:24,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:02:24,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:02:24,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:02:24,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:02:24,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5209c3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24, skipping insertion in model container [2024-10-13 17:02:24,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:02:24,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:02:24,446 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:02:24,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:02:24,527 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:02:24,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24 WrapperNode [2024-10-13 17:02:24,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:02:24,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:02:24,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:02:24,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:02:24,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,584 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-10-13 17:02:24,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:02:24,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:02:24,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:02:24,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:02:24,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,608 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-13 17:02:24,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:02:24,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:02:24,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:02:24,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:02:24,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (1/1) ... [2024-10-13 17:02:24,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:24,670 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) [2024-10-13 17:02:24,676 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 [2024-10-13 17:02:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:02:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:02:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:02:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:02:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:02:24,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:02:24,795 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:02:24,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:02:24,887 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 17:02:24,887 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:02:24,896 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:02:24,896 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 17:02:24,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:24 BoogieIcfgContainer [2024-10-13 17:02:24,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:02:24,898 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:02:24,898 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:02:24,901 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:02:24,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:02:24,902 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:02:24" (1/3) ... [2024-10-13 17:02:24,903 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab06891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:02:24, skipping insertion in model container [2024-10-13 17:02:24,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:02:24,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:24" (2/3) ... [2024-10-13 17:02:24,903 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ab06891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:02:24, skipping insertion in model container [2024-10-13 17:02:24,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:02:24,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:24" (3/3) ... [2024-10-13 17:02:24,904 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2024-10-13 17:02:24,944 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:02:24,944 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:02:24,944 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:02:24,944 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:02:24,945 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:02:24,945 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:02:24,945 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:02:24,945 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:02:24,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) 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) [2024-10-13 17:02:24,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:02:24,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:24,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:24,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:02:24,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:02:24,968 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:02:24,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) 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) [2024-10-13 17:02:24,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:02:24,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:24,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:24,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:02:24,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:02:24,975 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L558true assume !(main_~array_size~0#1 < 1); 6#L558-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 14#L562-3true [2024-10-13 17:02:24,975 INFO L747 eck$LassoCheckResult]: Loop: 14#L562-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 16#L562-2true main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 14#L562-3true [2024-10-13 17:02:24,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-13 17:02:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:24,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513427183] [2024-10-13 17:02:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-13 17:02:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851067974] [2024-10-13 17:02:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-13 17:02:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433529911] [2024-10-13 17:02:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:25,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:25,373 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:25,374 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:25,374 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:25,374 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:25,374 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:25,374 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:25,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:25,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2024-10-13 17:02:25,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:25,375 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:25,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:25,766 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:25,770 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,774 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) [2024-10-13 17:02:25,778 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 [2024-10-13 17:02:25,779 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 [2024-10-13 17:02:25,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:25,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:25,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:25,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:25,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:25,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:25,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:02:25,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,821 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) [2024-10-13 17:02:25,823 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 [2024-10-13 17:02:25,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:02:25,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:25,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:25,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:25,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:25,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:25,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:25,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 17:02:25,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,862 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) [2024-10-13 17:02:25,869 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 [2024-10-13 17:02:25,870 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 [2024-10-13 17:02:25,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:25,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:25,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:25,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:25,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:25,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:25,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,902 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) [2024-10-13 17:02:25,905 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 [2024-10-13 17:02:25,906 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 [2024-10-13 17:02:25,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:25,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:25,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:25,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:25,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:25,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:25,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:25,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,938 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) [2024-10-13 17:02:25,942 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 [2024-10-13 17:02:25,943 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 [2024-10-13 17:02:25,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:25,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:25,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:25,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:25,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:25,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:25,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:25,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:25,980 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) [2024-10-13 17:02:25,987 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 [2024-10-13 17:02:25,988 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 [2024-10-13 17:02:25,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:25,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:25,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:26,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:26,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:26,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:26,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:26,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:26,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:26,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:26,021 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) [2024-10-13 17:02:26,023 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 [2024-10-13 17:02:26,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:02:26,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:26,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:26,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:26,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:26,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:26,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:26,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:26,146 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-13 17:02:26,146 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-13 17:02:26,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:26,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:26,149 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) [2024-10-13 17:02:26,153 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 [2024-10-13 17:02:26,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:26,176 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:02:26,176 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:26,176 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2024-10-13 17:02:26,199 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 [2024-10-13 17:02:26,227 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:02:26,248 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:02:26,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:02:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:02:26,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:02:26,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,369 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 [2024-10-13 17:02:26,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:26,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 42 transitions. Complement of second has 6 states. [2024-10-13 17:02:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-10-13 17:02:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 17:02:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-13 17:02:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-13 17:02:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:26,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2024-10-13 17:02:26,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:02:26,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2024-10-13 17:02:26,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:02:26,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:02:26,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2024-10-13 17:02:26,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:26,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-13 17:02:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2024-10-13 17:02:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 17:02:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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) [2024-10-13 17:02:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-10-13 17:02:26,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-13 17:02:26,452 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-13 17:02:26,452 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:02:26,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-10-13 17:02:26,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:02:26,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:26,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:26,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:26,453 INFO L745 eck$LassoCheckResult]: Stem: 113#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 111#L558 assume !(main_~array_size~0#1 < 1); 112#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 117#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 107#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 108#L550-3 [2024-10-13 17:02:26,454 INFO L747 eck$LassoCheckResult]: Loop: 108#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 110#L551-3 assume !true; 115#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 108#L550-3 [2024-10-13 17:02:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-13 17:02:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296236770] [2024-10-13 17:02:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296236770] [2024-10-13 17:02:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296236770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:02:26,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:02:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:02:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040473119] [2024-10-13 17:02:26,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:02:26,529 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:02:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2024-10-13 17:02:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823440904] [2024-10-13 17:02:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823440904] [2024-10-13 17:02:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823440904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:02:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:02:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:02:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216858283] [2024-10-13 17:02:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:02:26,549 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:02:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:26,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:02:26,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:02:26,551 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:26,559 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-10-13 17:02:26,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2024-10-13 17:02:26,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:02:26,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2024-10-13 17:02:26,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:02:26,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:02:26,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-10-13 17:02:26,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:26,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:02:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-10-13 17:02:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 17:02:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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) [2024-10-13 17:02:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-13 17:02:26,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:02:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:02:26,572 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:02:26,572 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:02:26,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-13 17:02:26,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:02:26,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:26,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:26,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:26,573 INFO L745 eck$LassoCheckResult]: Stem: 148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 144#L558 assume !(main_~array_size~0#1 < 1); 145#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 150#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 140#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 141#L550-3 [2024-10-13 17:02:26,573 INFO L747 eck$LassoCheckResult]: Loop: 141#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 143#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 146#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 141#L550-3 [2024-10-13 17:02:26,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-10-13 17:02:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689378949] [2024-10-13 17:02:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689378949] [2024-10-13 17:02:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689378949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:02:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:02:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:02:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244851909] [2024-10-13 17:02:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:02:26,617 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:02:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2024-10-13 17:02:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901878624] [2024-10-13 17:02:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901878624] [2024-10-13 17:02:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901878624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:02:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:02:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:02:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140952014] [2024-10-13 17:02:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:02:26,633 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:02:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:26,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:02:26,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:02:26,634 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:26,653 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-13 17:02:26,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-10-13 17:02:26,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:26,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-10-13 17:02:26,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:02:26,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:02:26,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-13 17:02:26,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:26,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:02:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-13 17:02:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 17:02:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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) [2024-10-13 17:02:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-13 17:02:26,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:02:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:02:26,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-13 17:02:26,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:02:26,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-13 17:02:26,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:26,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:26,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:26,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,659 INFO L745 eck$LassoCheckResult]: Stem: 181#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 179#L558 assume !(main_~array_size~0#1 < 1); 180#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 185#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 175#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 176#L550-3 [2024-10-13 17:02:26,659 INFO L747 eck$LassoCheckResult]: Loop: 176#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 183#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 184#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 177#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 178#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 188#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 176#L550-3 [2024-10-13 17:02:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2024-10-13 17:02:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978105759] [2024-10-13 17:02:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:26,700 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 [2024-10-13 17:02:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978105759] [2024-10-13 17:02:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978105759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:02:26,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:02:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:02:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551814143] [2024-10-13 17:02:26,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:02:26,715 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:02:26,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2024-10-13 17:02:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753875546] [2024-10-13 17:02:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:02:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:02:26,834 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:26,855 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-13 17:02:26,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-13 17:02:26,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:26,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-10-13 17:02:26,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:02:26,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:02:26,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-13 17:02:26,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:26,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:02:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-13 17:02:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-13 17:02:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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) [2024-10-13 17:02:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-10-13 17:02:26,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-13 17:02:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:02:26,863 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-13 17:02:26,866 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:02:26,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-10-13 17:02:26,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:26,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:26,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:26,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:26,867 INFO L745 eck$LassoCheckResult]: Stem: 217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 215#L558 assume !(main_~array_size~0#1 < 1); 216#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 221#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 222#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 223#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 211#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 212#L550-3 [2024-10-13 17:02:26,867 INFO L747 eck$LassoCheckResult]: Loop: 212#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 219#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 220#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 213#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 214#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 224#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 212#L550-3 [2024-10-13 17:02:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-10-13 17:02:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479411547] [2024-10-13 17:02:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2024-10-13 17:02:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880027127] [2024-10-13 17:02:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:26,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:26,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2024-10-13 17:02:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295966568] [2024-10-13 17:02:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295966568] [2024-10-13 17:02:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295966568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:02:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519684898] [2024-10-13 17:02:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:27,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:02:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:27,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:02:27,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 17:02:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:27,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:02:27,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:27,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:02:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519684898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:02:27,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:02:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 17:02:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954435720] [2024-10-13 17:02:27,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:02:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:27,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 17:02:27,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 17:02:27,257 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2024-10-13 17:02:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:27,314 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-10-13 17:02:27,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2024-10-13 17:02:27,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:27,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2024-10-13 17:02:27,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:02:27,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:02:27,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-13 17:02:27,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:27,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-13 17:02:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-13 17:02:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-13 17:02:27,316 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) [2024-10-13 17:02:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-13 17:02:27,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:02:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:02:27,318 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:02:27,318 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:02:27,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-13 17:02:27,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:02:27,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:27,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:27,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:27,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:27,319 INFO L745 eck$LassoCheckResult]: Stem: 355#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 351#L558 assume !(main_~array_size~0#1 < 1); 352#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 357#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 358#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 359#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 360#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 362#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 347#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 348#L550-3 [2024-10-13 17:02:27,319 INFO L747 eck$LassoCheckResult]: Loop: 348#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 353#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 354#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 349#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 350#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 361#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 348#L550-3 [2024-10-13 17:02:27,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2024-10-13 17:02:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339325004] [2024-10-13 17:02:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:27,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2024-10-13 17:02:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301239430] [2024-10-13 17:02:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2024-10-13 17:02:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347731715] [2024-10-13 17:02:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:27,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:27,653 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:27,653 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:27,653 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:27,653 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:27,653 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:27,653 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:27,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:27,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:27,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2024-10-13 17:02:27,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:27,654 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:27,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:27,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:28,033 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:28,034 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:28,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,035 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) [2024-10-13 17:02:28,036 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 [2024-10-13 17:02:28,039 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 [2024-10-13 17:02:28,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:28,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:28,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:28,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-13 17:02:28,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,067 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) [2024-10-13 17:02:28,068 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 [2024-10-13 17:02:28,069 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 [2024-10-13 17:02:28,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:28,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:28,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:28,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,092 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 [2024-10-13 17:02:28,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,094 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) [2024-10-13 17:02:28,095 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 [2024-10-13 17:02:28,096 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 [2024-10-13 17:02:28,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:28,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:28,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:28,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,119 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 [2024-10-13 17:02:28,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,125 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) [2024-10-13 17:02:28,130 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 [2024-10-13 17:02:28,131 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 [2024-10-13 17:02:28,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:28,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:28,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:28,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,153 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 [2024-10-13 17:02:28,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,155 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) [2024-10-13 17:02:28,156 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 [2024-10-13 17:02:28,157 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 [2024-10-13 17:02:28,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:28,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:28,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,185 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 [2024-10-13 17:02:28,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,189 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:28,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:02:28,191 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 [2024-10-13 17:02:28,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:28,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:28,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:28,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,225 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) [2024-10-13 17:02:28,229 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 [2024-10-13 17:02:28,230 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 [2024-10-13 17:02:28,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:28,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:28,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:28,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,260 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) [2024-10-13 17:02:28,263 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 [2024-10-13 17:02:28,264 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 [2024-10-13 17:02:28,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:28,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:28,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:28,300 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 [2024-10-13 17:02:28,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,304 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) [2024-10-13 17:02:28,305 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 [2024-10-13 17:02:28,306 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 [2024-10-13 17:02:28,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:28,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:28,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:28,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:28,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:28,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:28,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:28,364 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-13 17:02:28,364 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:02:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:28,366 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) [2024-10-13 17:02:28,368 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 [2024-10-13 17:02:28,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:28,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:02:28,381 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:28,381 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 0)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 0)_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1 Supporting invariants [] [2024-10-13 17:02:28,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:28,421 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:02:28,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2024-10-13 17:02:28,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:28,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:02:28,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:28,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:02:28,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:28,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-10-13 17:02:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:28,995 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:02:28,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2024-10-13 17:02:29,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Result 36 states and 46 transitions. Complement of second has 10 states. [2024-10-13 17:02:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2024-10-13 17:02:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-13 17:02:29,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-13 17:02:29,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:29,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 16 letters. Loop has 6 letters. [2024-10-13 17:02:29,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:29,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 10 letters. Loop has 12 letters. [2024-10-13 17:02:29,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:29,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2024-10-13 17:02:29,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-13 17:02:29,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2024-10-13 17:02:29,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 17:02:29,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-13 17:02:29,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-10-13 17:02:29,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:29,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-13 17:02:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-10-13 17:02:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-10-13 17:02:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-13 17:02:29,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-13 17:02:29,119 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-13 17:02:29,119 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:02:29,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2024-10-13 17:02:29,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 17:02:29,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:29,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:29,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:29,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:29,120 INFO L745 eck$LassoCheckResult]: Stem: 519#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 520#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 517#L558 assume !(main_~array_size~0#1 < 1); 518#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 525#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 529#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 530#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 531#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 537#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 511#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 512#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 527#L551-3 [2024-10-13 17:02:29,120 INFO L747 eck$LassoCheckResult]: Loop: 527#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 532#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 513#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 514#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 538#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 526#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 527#L551-3 [2024-10-13 17:02:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2024-10-13 17:02:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145995547] [2024-10-13 17:02:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2046083018, now seen corresponding path program 1 times [2024-10-13 17:02:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701258058] [2024-10-13 17:02:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:29,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2024-10-13 17:02:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961421842] [2024-10-13 17:02:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:29,390 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 [2024-10-13 17:02:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961421842] [2024-10-13 17:02:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961421842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:02:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854655627] [2024-10-13 17:02:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:02:29,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:29,422 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:02:29,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 17:02:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:29,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:02:29,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:29,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:02:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 17:02:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854655627] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:02:29,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:02:29,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 17:02:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763654332] [2024-10-13 17:02:29,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:02:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 17:02:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 17:02:29,655 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 13 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:29,696 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-10-13 17:02:29,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2024-10-13 17:02:29,697 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-10-13 17:02:29,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 48 states and 61 transitions. [2024-10-13 17:02:29,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-13 17:02:29,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-13 17:02:29,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2024-10-13 17:02:29,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:29,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-10-13 17:02:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2024-10-13 17:02:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-10-13 17:02:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-10-13 17:02:29,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-13 17:02:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 17:02:29,701 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-13 17:02:29,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:02:29,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2024-10-13 17:02:29,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-13 17:02:29,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:29,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:29,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:29,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:02:29,703 INFO L745 eck$LassoCheckResult]: Stem: 724#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 719#L558 assume !(main_~array_size~0#1 < 1); 720#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 729#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 730#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 731#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 732#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 741#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 742#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 743#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 740#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 738#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 739#L551-3 [2024-10-13 17:02:29,703 INFO L747 eck$LassoCheckResult]: Loop: 739#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 750#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 748#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 744#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 745#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 751#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 739#L551-3 [2024-10-13 17:02:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -855173556, now seen corresponding path program 2 times [2024-10-13 17:02:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182417391] [2024-10-13 17:02:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2046083018, now seen corresponding path program 2 times [2024-10-13 17:02:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140285553] [2024-10-13 17:02:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:29,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2024-10-13 17:02:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980075280] [2024-10-13 17:02:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980075280] [2024-10-13 17:02:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980075280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:02:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664743745] [2024-10-13 17:02:29,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:02:29,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:02:29,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:29,862 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:02:29,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 17:02:29,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:02:29,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:02:29,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:02:29,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 17:02:29,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:02:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 17:02:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664743745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:02:30,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:02:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2024-10-13 17:02:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89666148] [2024-10-13 17:02:30,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:02:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 17:02:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-13 17:02:30,162 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 17 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) [2024-10-13 17:02:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:30,297 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2024-10-13 17:02:30,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 116 transitions. [2024-10-13 17:02:30,298 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2024-10-13 17:02:30,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 110 transitions. [2024-10-13 17:02:30,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-13 17:02:30,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-13 17:02:30,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 110 transitions. [2024-10-13 17:02:30,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:30,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 110 transitions. [2024-10-13 17:02:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 110 transitions. [2024-10-13 17:02:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2024-10-13 17:02:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-10-13 17:02:30,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-10-13 17:02:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 17:02:30,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-10-13 17:02:30,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:02:30,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2024-10-13 17:02:30,308 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-13 17:02:30,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:30,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:30,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:30,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2024-10-13 17:02:30,308 INFO L745 eck$LassoCheckResult]: Stem: 996#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 991#L558 assume !(main_~array_size~0#1 < 1); 992#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1001#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1002#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1003#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1004#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1011#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1013#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1012#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1014#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1021#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 999#L551-3 [2024-10-13 17:02:30,308 INFO L747 eck$LassoCheckResult]: Loop: 999#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1029#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 987#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 988#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 993#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1031#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1018#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1019#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 998#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 999#L551-3 [2024-10-13 17:02:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash -855173556, now seen corresponding path program 3 times [2024-10-13 17:02:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027261721] [2024-10-13 17:02:30,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 735525585, now seen corresponding path program 3 times [2024-10-13 17:02:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619847411] [2024-10-13 17:02:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:30,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2024-10-13 17:02:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:30,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350693995] [2024-10-13 17:02:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:30,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:30,663 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:30,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:30,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:30,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:30,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:30,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:30,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:30,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:30,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration9_Lasso [2024-10-13 17:02:30,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:30,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:30,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:30,981 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:30,981 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:30,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:30,982 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) [2024-10-13 17:02:30,983 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 [2024-10-13 17:02:30,984 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 [2024-10-13 17:02:30,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:30,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:30,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:30,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:30,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:30,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:30,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:30,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,006 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 [2024-10-13 17:02:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,008 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) [2024-10-13 17:02:31,009 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 [2024-10-13 17:02:31,010 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 [2024-10-13 17:02:31,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:31,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:31,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:31,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,037 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) [2024-10-13 17:02:31,038 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 [2024-10-13 17:02:31,039 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 [2024-10-13 17:02:31,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:31,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:31,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:31,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 17:02:31,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,062 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:02:31,065 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 [2024-10-13 17:02:31,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:31,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:31,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,098 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:02:31,100 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 [2024-10-13 17:02:31,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:31,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:31,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:31,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,124 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:02:31,128 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 [2024-10-13 17:02:31,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:31,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:31,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:31,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:31,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,158 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:02:31,159 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 [2024-10-13 17:02:31,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:31,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:31,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:31,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:31,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:31,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:31,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:31,213 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 17:02:31,213 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:02:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,217 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 17:02:31,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:31,231 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:02:31,231 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:31,232 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2024-10-13 17:02:31,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 17:02:31,249 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:02:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:31,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:02:31,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:31,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:02:31,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 17:02:31,330 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 [2024-10-13 17:02:31,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:31,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 82 states and 107 transitions. Complement of second has 6 states. [2024-10-13 17:02:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 17:02:31,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 9 letters. [2024-10-13 17:02:31,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:31,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 9 letters. [2024-10-13 17:02:31,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:31,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 18 letters. [2024-10-13 17:02:31,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:31,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 107 transitions. [2024-10-13 17:02:31,355 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-13 17:02:31,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 66 states and 86 transitions. [2024-10-13 17:02:31,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-13 17:02:31,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-13 17:02:31,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-10-13 17:02:31,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:31,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-10-13 17:02:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-10-13 17:02:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2024-10-13 17:02:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 51 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-10-13 17:02:31,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-10-13 17:02:31,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-10-13 17:02:31,365 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:02:31,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 69 transitions. [2024-10-13 17:02:31,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:02:31,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:31,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:31,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:31,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:31,373 INFO L745 eck$LassoCheckResult]: Stem: 1232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1227#L558 assume !(main_~array_size~0#1 < 1); 1228#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1238#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1239#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1240#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1241#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1246#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1248#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1234#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1235#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1264#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1223#L551-2 [2024-10-13 17:02:31,373 INFO L747 eck$LassoCheckResult]: Loop: 1223#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1224#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1229#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1223#L551-2 [2024-10-13 17:02:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -856885551, now seen corresponding path program 1 times [2024-10-13 17:02:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246572273] [2024-10-13 17:02:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash 75248, now seen corresponding path program 1 times [2024-10-13 17:02:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914564318] [2024-10-13 17:02:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1808203040, now seen corresponding path program 1 times [2024-10-13 17:02:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112995039] [2024-10-13 17:02:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:31,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 17:02:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112995039] [2024-10-13 17:02:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112995039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:02:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772159426] [2024-10-13 17:02:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:02:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:31,550 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:02:31,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-13 17:02:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:31,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:02:31,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:31,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:02:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772159426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:02:31,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:02:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-13 17:02:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422291891] [2024-10-13 17:02:31,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:02:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 17:02:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-13 17:02:31,785 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. cyclomatic complexity: 22 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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) [2024-10-13 17:02:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:31,852 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-13 17:02:31,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2024-10-13 17:02:31,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:02:31,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 49 states and 64 transitions. [2024-10-13 17:02:31,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:02:31,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:02:31,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2024-10-13 17:02:31,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:31,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-10-13 17:02:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2024-10-13 17:02:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-13 17:02:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3125) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:02:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-10-13 17:02:31,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-13 17:02:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:02:31,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-13 17:02:31,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:02:31,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 63 transitions. [2024-10-13 17:02:31,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-13 17:02:31,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:31,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:31,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:31,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:31,857 INFO L745 eck$LassoCheckResult]: Stem: 1455#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1449#L558 assume !(main_~array_size~0#1 < 1); 1450#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1459#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1460#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1461#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1462#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1464#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1466#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1465#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1443#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1444#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1457#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1467#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1445#L551-2 [2024-10-13 17:02:31,857 INFO L747 eck$LassoCheckResult]: Loop: 1445#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1446#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1468#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1445#L551-2 [2024-10-13 17:02:31,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1483032529, now seen corresponding path program 2 times [2024-10-13 17:02:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442360502] [2024-10-13 17:02:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 75248, now seen corresponding path program 2 times [2024-10-13 17:02:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186223819] [2024-10-13 17:02:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1306547970, now seen corresponding path program 2 times [2024-10-13 17:02:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843517041] [2024-10-13 17:02:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:31,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:32,364 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:32,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:32,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:32,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:32,364 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:32,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:32,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:32,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:32,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration11_Lasso [2024-10-13 17:02:32,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:32,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:32,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:32,838 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:32,838 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:32,840 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:32,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 17:02:32,842 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 [2024-10-13 17:02:32,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:32,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:32,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:32,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:32,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:32,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:32,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:32,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:32,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-13 17:02:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:32,867 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:32,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 17:02:32,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:02:32,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:32,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:32,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:32,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:32,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:32,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:32,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:32,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:32,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:32,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:32,897 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:32,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 17:02:32,899 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 [2024-10-13 17:02:32,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:32,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:32,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:32,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:32,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:32,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:32,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:32,956 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:02:32,957 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-13 17:02:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:32,959 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:32,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 17:02:32,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:32,972 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:02:32,972 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:32,972 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~i~0#1) = 4611686018427387903*ULTIMATE.start_sort_~pass~0#1 - 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [18446744073709551612*ULTIMATE.start_sort_~pass~0#1 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_4 + 1*ULTIMATE.start_sort_~x#1.offset >= 0] [2024-10-13 17:02:32,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-13 17:02:32,995 INFO L156 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:02:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:33,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 17:02:33,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:33,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-13 17:02:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:33,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:02:33,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:33,180 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2024-10-13 17:02:33,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 63 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2024-10-13 17:02:33,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 63 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Result 103 states and 139 transitions. Complement of second has 9 states. [2024-10-13 17:02:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2024-10-13 17:02:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-13 17:02:33,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-13 17:02:33,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:33,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2024-10-13 17:02:33,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:33,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-13 17:02:33,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:33,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 139 transitions. [2024-10-13 17:02:33,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:33,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 93 states and 125 transitions. [2024-10-13 17:02:33,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-13 17:02:33,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-13 17:02:33,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 125 transitions. [2024-10-13 17:02:33,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:33,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-10-13 17:02:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 125 transitions. [2024-10-13 17:02:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2024-10-13 17:02:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 86 states have internal predecessors, (116), 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) [2024-10-13 17:02:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2024-10-13 17:02:33,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 116 transitions. [2024-10-13 17:02:33,249 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 116 transitions. [2024-10-13 17:02:33,249 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:02:33,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 116 transitions. [2024-10-13 17:02:33,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:33,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:33,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:33,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:33,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:33,250 INFO L745 eck$LassoCheckResult]: Stem: 1713#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1714#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1709#L558 assume !(main_~array_size~0#1 < 1); 1710#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1719#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1720#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1721#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1722#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1729#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1728#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1727#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1703#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1704#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1716#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1711#L552 [2024-10-13 17:02:33,250 INFO L747 eck$LassoCheckResult]: Loop: 1711#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1705#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1706#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1711#L552 [2024-10-13 17:02:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -740576421, now seen corresponding path program 1 times [2024-10-13 17:02:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772503829] [2024-10-13 17:02:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2024-10-13 17:02:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662293969] [2024-10-13 17:02:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 734885290, now seen corresponding path program 1 times [2024-10-13 17:02:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318152907] [2024-10-13 17:02:33,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:33,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:33,607 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:33,607 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:33,607 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:33,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:33,608 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:33,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:33,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:33,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:33,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration12_Lasso [2024-10-13 17:02:33,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:33,608 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:33,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-13 17:02:33,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:33,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:34,034 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:34,034 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,036 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 17:02:34,037 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 [2024-10-13 17:02:34,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:34,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:34,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:34,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:34,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:34,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:34,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:34,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:34,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,061 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 17:02:34,062 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 [2024-10-13 17:02:34,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:34,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:34,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:34,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:34,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:34,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:34,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:34,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:34,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,086 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 17:02:34,088 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 [2024-10-13 17:02:34,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:34,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:34,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:34,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:34,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:34,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:34,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:34,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:34,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,116 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 17:02:34,118 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 [2024-10-13 17:02:34,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:34,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:34,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:34,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:34,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:34,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:34,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:34,172 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2024-10-13 17:02:34,172 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:02:34,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,174 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 17:02:34,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:34,187 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:02:34,187 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:34,187 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [1*ULTIMATE.start_sort_~pass~0#1 >= 0] [2024-10-13 17:02:34,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:34,207 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:02:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:34,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:02:34,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:34,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:02:34,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:34,276 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-13 17:02:34,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 116 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2024-10-13 17:02:34,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 116 transitions. cyclomatic complexity: 40. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) Result 154 states and 210 transitions. Complement of second has 8 states. [2024-10-13 17:02:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2024-10-13 17:02:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-10-13 17:02:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:02:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-13 17:02:34,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:34,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-13 17:02:34,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:34,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 210 transitions. [2024-10-13 17:02:34,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:34,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 127 states and 171 transitions. [2024-10-13 17:02:34,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-13 17:02:34,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-13 17:02:34,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 171 transitions. [2024-10-13 17:02:34,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:34,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 171 transitions. [2024-10-13 17:02:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 171 transitions. [2024-10-13 17:02:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2024-10-13 17:02:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.33) internal successors, (133), 99 states have internal predecessors, (133), 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) [2024-10-13 17:02:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2024-10-13 17:02:34,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 133 transitions. [2024-10-13 17:02:34,317 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 133 transitions. [2024-10-13 17:02:34,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 17:02:34,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 133 transitions. [2024-10-13 17:02:34,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:34,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:34,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:34,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:34,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:34,318 INFO L745 eck$LassoCheckResult]: Stem: 2054#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2052#L558 assume !(main_~array_size~0#1 < 1); 2053#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2060#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2065#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2066#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2067#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2075#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2074#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2073#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2046#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2047#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2061#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2121#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2120#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2056#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2057#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2108#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2091#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2089#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 2087#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2084#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2077#L552 [2024-10-13 17:02:34,318 INFO L747 eck$LassoCheckResult]: Loop: 2077#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2048#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2049#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2077#L552 [2024-10-13 17:02:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash -641628991, now seen corresponding path program 3 times [2024-10-13 17:02:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704661063] [2024-10-13 17:02:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:34,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:34,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2024-10-13 17:02:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616345947] [2024-10-13 17:02:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:34,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:34,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2130205442, now seen corresponding path program 4 times [2024-10-13 17:02:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328518466] [2024-10-13 17:02:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 17:02:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:02:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328518466] [2024-10-13 17:02:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328518466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:02:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807830978] [2024-10-13 17:02:34,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:02:34,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:02:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:34,494 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:02:34,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-10-13 17:02:34,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:02:34,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:02:34,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:02:34,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 17:02:34,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:02:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 17:02:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807830978] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:02:34,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:02:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-10-13 17:02:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37837986] [2024-10-13 17:02:34,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:02:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:02:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 17:02:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-13 17:02:34,818 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. cyclomatic complexity: 46 Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 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) [2024-10-13 17:02:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:02:34,934 INFO L93 Difference]: Finished difference Result 276 states and 359 transitions. [2024-10-13 17:02:34,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 359 transitions. [2024-10-13 17:02:34,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:34,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 180 states and 236 transitions. [2024-10-13 17:02:34,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-13 17:02:34,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-13 17:02:34,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 236 transitions. [2024-10-13 17:02:34,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:02:34,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 236 transitions. [2024-10-13 17:02:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 236 transitions. [2024-10-13 17:02:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2024-10-13 17:02:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 125 states have internal predecessors, (164), 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) [2024-10-13 17:02:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2024-10-13 17:02:34,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 164 transitions. [2024-10-13 17:02:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 17:02:34,944 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2024-10-13 17:02:34,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 17:02:34,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 164 transitions. [2024-10-13 17:02:34,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:02:34,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:02:34,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:02:34,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:02:34,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:02:34,946 INFO L745 eck$LassoCheckResult]: Stem: 2615#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2616#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2609#L558 assume !(main_~array_size~0#1 < 1); 2610#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2617#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2621#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2622#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2623#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2629#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2633#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2632#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2631#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2630#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2603#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2604#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2611#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2612#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 2724#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2723#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2722#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2607#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2608#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2728#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 2702#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2646#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2644#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 2641#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2639#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2637#L552 [2024-10-13 17:02:34,946 INFO L747 eck$LassoCheckResult]: Loop: 2637#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2625#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2638#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2637#L552 [2024-10-13 17:02:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1180597262, now seen corresponding path program 1 times [2024-10-13 17:02:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267977416] [2024-10-13 17:02:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:34,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:35,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-13 17:02:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:35,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:35,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2024-10-13 17:02:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:35,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068630438] [2024-10-13 17:02:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:35,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:35,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 314196529, now seen corresponding path program 2 times [2024-10-13 17:02:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:02:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034857858] [2024-10-13 17:02:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:02:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:02:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:35,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:02:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:02:35,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:02:36,335 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:02:36,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:02:36,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:02:36,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:02:36,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:02:36,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:36,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:02:36,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:02:36,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration14_Lasso [2024-10-13 17:02:36,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:02:36,336 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:02:36,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:02:36,929 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:02:36,930 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:02:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:36,933 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:36,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 17:02:36,942 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 [2024-10-13 17:02:36,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:36,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:36,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:36,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:36,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:36,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:36,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:36,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:36,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:36,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:36,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:36,969 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:36,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 17:02:36,972 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 [2024-10-13 17:02:36,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:36,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:36,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:36,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:36,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:36,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:36,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:36,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:36,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 17:02:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:36,995 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 17:02:36,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:02:37,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:37,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:37,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:37,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-13 17:02:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,020 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 17:02:37,021 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 [2024-10-13 17:02:37,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:37,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:37,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:37,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,044 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 17:02:37,046 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 [2024-10-13 17:02:37,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:37,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:37,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,077 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 17:02:37,079 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 [2024-10-13 17:02:37,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:02:37,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:02:37,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:02:37,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,102 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 17:02:37,104 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 [2024-10-13 17:02:37,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:37,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:37,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-13 17:02:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,130 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 17:02:37,131 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 [2024-10-13 17:02:37,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:37,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:37,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:02:37,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 17:02:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,176 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 17:02:37,179 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 [2024-10-13 17:02:37,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:02:37,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:02:37,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:02:37,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:02:37,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:02:37,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:02:37,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:02:37,234 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:02:37,234 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:02:37,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:02:37,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:02:37,236 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:02:37,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 17:02:37,238 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:02:37,249 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:02:37,250 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:02:37,250 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_6, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_6 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-10-13 17:02:37,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-13 17:02:37,269 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:02:37,270 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-10-13 17:02:37,270 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:02:37,270 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:02:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:37,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:02:37,460 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 180 states and 245 transitions. Complement of second has 9 states. [2024-10-13 17:02:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:02:37,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-13 17:02:37,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:37,519 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:02:37,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:37,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 17:02:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:37,706 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:02:37,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 180 states and 245 transitions. Complement of second has 9 states. [2024-10-13 17:02:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:02:37,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-13 17:02:37,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:37,747 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:02:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:02:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:02:37,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:02:37,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:02:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:02:37,889 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:02:37,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 126 states and 164 transitions. cyclomatic complexity: 51. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 214 states and 296 transitions. Complement of second has 8 states. [2024-10-13 17:02:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:02:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2024-10-13 17:02:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-13 17:02:37,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-13 17:02:37,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:37,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 31 letters. Loop has 3 letters. [2024-10-13 17:02:37,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:37,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 28 letters. Loop has 6 letters. [2024-10-13 17:02:37,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:02:37,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 296 transitions. [2024-10-13 17:02:37,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:02:37,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 0 states and 0 transitions. [2024-10-13 17:02:37,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:02:37,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:02:37,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:02:37,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:02:37,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:02:37,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:02:37,935 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:02:37,936 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 17:02:37,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:02:37,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:02:37,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:02:37,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:02:37 BoogieIcfgContainer [2024-10-13 17:02:37,942 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:02:37,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:02:37,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:02:37,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:02:37,943 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:24" (3/4) ... [2024-10-13 17:02:37,944 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:02:37,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:02:37,946 INFO L158 Benchmark]: Toolchain (without parser) took 13805.77ms. Allocated memory was 134.2MB in the beginning and 333.4MB in the end (delta: 199.2MB). Free memory was 63.4MB in the beginning and 240.4MB in the end (delta: -177.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,946 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 134.2MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:02:37,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.80ms. Allocated memory is still 134.2MB. Free memory was 63.4MB in the beginning and 45.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 45.3MB in the beginning and 161.3MB in the end (delta: -116.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,947 INFO L158 Benchmark]: Boogie Preprocessor took 44.55ms. Allocated memory is still 190.8MB. Free memory was 161.3MB in the beginning and 160.7MB in the end (delta: 513.9kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,947 INFO L158 Benchmark]: RCFGBuilder took 266.80ms. Allocated memory is still 190.8MB. Free memory was 160.7MB in the beginning and 148.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,947 INFO L158 Benchmark]: BuchiAutomizer took 13044.43ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 148.2MB in the beginning and 240.4MB in the end (delta: -92.2MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-10-13 17:02:37,947 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 333.4MB. Free memory is still 240.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:02:37,948 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.89ms. Allocated memory is still 134.2MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.80ms. Allocated memory is still 134.2MB. Free memory was 63.4MB in the beginning and 45.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 45.3MB in the beginning and 161.3MB in the end (delta: -116.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.55ms. Allocated memory is still 190.8MB. Free memory was 161.3MB in the beginning and 160.7MB in the end (delta: 513.9kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 266.80ms. Allocated memory is still 190.8MB. Free memory was 160.7MB in the beginning and 148.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13044.43ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 148.2MB in the beginning and 240.4MB in the end (delta: -92.2MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 333.4MB. Free memory is still 240.4MB. 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] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - 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 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function (((long) -1 * pass) + n) and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + ((__int128) 4611686018427387903 * pass)) and consists of 6 locations. One deterministic module has affine ranking function (n + ((long) -1 * i)) and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 10.3s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 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 [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 152 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI2 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax110 hnf100 lsp88 ukn62 mio100 lsp50 div132 bol100 ite100 ukn100 eq171 hnf91 smp84 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 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! [2024-10-13 17:02:37,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-10-13 17:02:38,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-13 17:02:38,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-13 17:02:38,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 17:02:38,983 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