./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:16:12,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:16:12,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:16:12,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:16:12,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:16:12,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:16:12,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:16:12,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:16:12,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:16:12,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:16:12,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:16:12,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:16:12,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:16:12,449 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:16:12,449 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:16:12,451 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:16:12,451 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:16:12,452 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:16:12,452 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:16:12,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:16:12,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:16:12,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:16:12,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:16:12,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:16:12,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:16:12,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:16:12,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:16:12,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:16:12,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:16:12,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:16:12,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:16:12,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:16:12,461 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:16:12,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:16:12,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:16:12,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:16:12,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:16:12,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:16:12,463 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:16:12,464 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 [2024-11-23 02:16:12,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:16:12,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:16:12,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:16:12,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:16:12,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:16:12,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-23 02:16:14,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:16:14,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:16:14,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-23 02:16:14,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a47c5ddc/95abac540adc48ceb3f2b1767f55ed8b/FLAGeb85f5094 [2024-11-23 02:16:14,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a47c5ddc/95abac540adc48ceb3f2b1767f55ed8b [2024-11-23 02:16:14,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:16:14,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:16:14,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:16:14,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:16:14,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:16:14,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:14" (1/1) ... [2024-11-23 02:16:14,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5c994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:14, skipping insertion in model container [2024-11-23 02:16:14,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:14" (1/1) ... [2024-11-23 02:16:14,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:16:15,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:16:15,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:16:15,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:16:15,096 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:16:15,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15 WrapperNode [2024-11-23 02:16:15,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:16:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:16:15,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:16:15,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:16:15,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,140 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-23 02:16:15,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:16:15,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:16:15,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:16:15,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:16:15,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,169 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-11-23 02:16:15,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:16:15,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:16:15,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:16:15,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:16:15,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (1/1) ... [2024-11-23 02:16:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:15,257 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-11-23 02:16:15,269 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-11-23 02:16:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:16:15,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:16:15,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:16:15,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:16:15,534 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-23 02:16:15,534 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:16:15,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:16:15,557 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 02:16:15,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:15 BoogieIcfgContainer [2024-11-23 02:16:15,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:16:15,559 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:16:15,559 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:16:15,569 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:16:15,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:15,570 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:16:14" (1/3) ... [2024-11-23 02:16:15,571 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53477585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:15, skipping insertion in model container [2024-11-23 02:16:15,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:15,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:15" (2/3) ... [2024-11-23 02:16:15,572 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53477585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:15, skipping insertion in model container [2024-11-23 02:16:15,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:15,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:15" (3/3) ... [2024-11-23 02:16:15,575 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2024-11-23 02:16:15,649 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:16:15,649 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:16:15,649 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:16:15,649 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:16:15,650 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:16:15,650 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:16:15,650 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:16:15,651 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:16:15,655 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-11-23 02:16:15,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-23 02:16:15,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:15,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:15,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:16:15,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:15,678 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:16:15,679 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-11-23 02:16:15,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-23 02:16:15,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:15,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:15,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:16:15,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:15,687 INFO L745 eck$LassoCheckResult]: Stem: 12#$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_~k~0#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; 9#L527true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 11#L527-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 15#L532-3true [2024-11-23 02:16:15,688 INFO L747 eck$LassoCheckResult]: Loop: 15#L532-3true assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 3#L532-2true main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 15#L532-3true [2024-11-23 02:16:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-23 02:16:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909135069] [2024-11-23 02:16:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-11-23 02:16:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066013825] [2024-11-23 02:16:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:15,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-11-23 02:16:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288501273] [2024-11-23 02:16:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:15,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:16,291 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:16,291 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:16,291 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:16,292 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:16,292 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:16,292 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,292 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:16,292 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:16,292 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2024-11-23 02:16:16,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:16,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:16,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:16,756 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:16,760 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,765 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-11-23 02:16:16,766 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-11-23 02:16:16,767 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-11-23 02:16:16,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:16,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:16,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:16,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,796 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-11-23 02:16:16,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,800 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-11-23 02:16:16,801 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-11-23 02:16:16,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:16,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:16,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:16,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:16,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,829 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-11-23 02:16:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,832 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-11-23 02:16:16,834 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-11-23 02:16:16,835 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-11-23 02:16:16,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:16,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:16,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:16:16,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,870 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-11-23 02:16:16,871 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-11-23 02:16:16,872 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-11-23 02:16:16,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:16,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:16,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:16,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,903 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-11-23 02:16:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,906 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-11-23 02:16:16,908 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-11-23 02:16:16,909 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-11-23 02:16:16,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:16,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:16,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-23 02:16:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,944 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-11-23 02:16:16,949 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-11-23 02:16:16,950 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-11-23 02:16:16,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:16,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:16,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:16,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:16,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:16,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:16,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:16,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:16,976 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-11-23 02:16:16,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:16,977 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-11-23 02:16:16,985 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-11-23 02:16:16,990 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-11-23 02:16:17,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:17,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:17,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:17,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:17,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:17,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:17,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:17,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:17,016 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-11-23 02:16:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,021 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-11-23 02:16:17,023 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-11-23 02:16:17,023 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-11-23 02:16:17,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:17,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:17,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:17,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:17,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:17,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:17,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:17,056 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-11-23 02:16:17,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:16:17,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:16:17,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-11-23 02:16:17,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:17,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:17,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:17,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:17,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:17,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:17,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:17,134 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-23 02:16:17,134 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-23 02:16:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,140 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-11-23 02:16:17,141 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-11-23 02:16:17,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:17,157 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:16:17,157 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:17,158 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2024-11-23 02:16:17,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-23 02:16:17,184 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-23 02:16:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:17,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:17,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:17,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:16:17,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:17,299 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-11-23 02:16:17,300 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-11-23 02:16:17,337 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-11-23 02:16:17,340 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-11-23 02:16:17,344 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-11-23 02:16:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-23 02:16:17,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 02:16:17,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:17,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-23 02:16:17,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:17,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-23 02:16:17,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:17,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2024-11-23 02:16:17,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:16:17,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2024-11-23 02:16:17,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:17,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-23 02:16:17,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2024-11-23 02:16:17,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:17,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-23 02:16:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2024-11-23 02:16:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-23 02:16:17,377 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-11-23 02:16:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-11-23 02:16:17,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-23 02:16:17,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-23 02:16:17,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:16:17,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-11-23 02:16:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:16:17,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:17,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:17,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:16:17,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:17,382 INFO L745 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 109#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_~k~0#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; 98#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 99#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 100#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 103#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 104#L515-3 [2024-11-23 02:16:17,383 INFO L747 eck$LassoCheckResult]: Loop: 104#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 105#L516-3 assume !true; 106#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 104#L515-3 [2024-11-23 02:16:17,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-11-23 02:16:17,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:17,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728324874] [2024-11-23 02:16:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:17,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728324874] [2024-11-23 02:16:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728324874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:16:17,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:16:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:16:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896898253] [2024-11-23 02:16:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:16:17,516 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2024-11-23 02:16:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644128430] [2024-11-23 02:16:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644128430] [2024-11-23 02:16:17,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644128430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:16:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:16:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:16:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088498717] [2024-11-23 02:16:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:16:17,524 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:16:17,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 02:16:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 02:16:17,528 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-11-23 02:16:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:17,532 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-11-23 02:16:17,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2024-11-23 02:16:17,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:16:17,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2024-11-23 02:16:17,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-23 02:16:17,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-23 02:16:17,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-23 02:16:17,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:17,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:16:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-23 02:16:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-23 02:16:17,535 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-11-23 02:16:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-23 02:16:17,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:16:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 02:16:17,536 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:16:17,536 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:16:17,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-23 02:16:17,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:16:17,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:17,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:17,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:16:17,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:17,540 INFO L745 eck$LassoCheckResult]: Stem: 141#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#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_~k~0#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; 131#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 132#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 133#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 136#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 137#L515-3 [2024-11-23 02:16:17,540 INFO L747 eck$LassoCheckResult]: Loop: 137#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 138#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 139#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 137#L515-3 [2024-11-23 02:16:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-11-23 02:16:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271288441] [2024-11-23 02:16:17,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:17,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:16:17,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:17,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:17,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271288441] [2024-11-23 02:16:17,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271288441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:16:17,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:16:17,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:16:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291568956] [2024-11-23 02:16:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:16:17,619 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2024-11-23 02:16:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971264793] [2024-11-23 02:16:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:17,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:17,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:17,648 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:17,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:17,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:17,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:17,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:16:17,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:17,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:17,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-23 02:16:17,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:17,649 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:17,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,721 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:17,721 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:16:17,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,726 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-11-23 02:16:17,727 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-11-23 02:16:17,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:16:17,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:16:17,744 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:16:17,744 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:16:17,751 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-11-23 02:16:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,754 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-11-23 02:16:17,755 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-11-23 02:16:17,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:16:17,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:16:17,771 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:16:17,772 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Honda state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:16:17,780 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-11-23 02:16:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,783 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-11-23 02:16:17,786 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-11-23 02:16:17,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:16:17,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:16:17,815 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-11-23 02:16:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,817 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-11-23 02:16:17,818 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-11-23 02:16:17,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:16:17,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:16:17,835 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:16:17,843 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-11-23 02:16:17,847 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:17,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:17,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:17,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:17,847 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:17,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:17,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:17,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-23 02:16:17,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:17,848 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:17,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:17,963 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:17,966 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:17,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:17,968 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-11-23 02:16:17,970 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-11-23 02:16:17,975 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-11-23 02:16:17,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:17,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:17,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:17,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:17,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:17,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:17,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:17,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:17,999 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-11-23 02:16:17,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:18,002 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-11-23 02:16:18,004 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-11-23 02:16:18,006 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-11-23 02:16:18,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:18,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:18,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:18,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:18,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:18,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:18,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:18,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:18,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:16:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:18,034 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-11-23 02:16:18,035 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-11-23 02:16:18,036 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-11-23 02:16:18,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:18,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:18,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:18,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:18,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:18,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:18,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:18,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:18,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:16:18,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:16:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:18,059 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-11-23 02:16:18,061 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-11-23 02:16:18,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:18,062 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:16:18,062 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:18,062 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2024-11-23 02:16:18,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:18,072 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:16:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:18,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:18,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:18,132 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:16:18,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:18,162 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-11-23 02:16:18,162 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:18,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 28 transitions. Complement of second has 4 states. [2024-11-23 02:16:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:16:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-23 02:16:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-23 02:16:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-23 02:16:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:18,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2024-11-23 02:16:18,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:18,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2024-11-23 02:16:18,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:18,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2024-11-23 02:16:18,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:18,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-23 02:16:18,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2024-11-23 02:16:18,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:18,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2024-11-23 02:16:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2024-11-23 02:16:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-23 02:16:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2024-11-23 02:16:18,202 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2024-11-23 02:16:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:16:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:16:18,202 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. 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-11-23 02:16:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:18,227 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2024-11-23 02:16:18,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2024-11-23 02:16:18,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:18,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2024-11-23 02:16:18,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:18,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:18,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-11-23 02:16:18,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:18,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-23 02:16:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-11-23 02:16:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-23 02:16:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2024-11-23 02:16:18,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-23 02:16:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:16:18,233 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-23 02:16:18,233 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:16:18,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2024-11-23 02:16:18,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:18,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:18,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:18,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:18,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:18,234 INFO L745 eck$LassoCheckResult]: Stem: 256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 257#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_~k~0#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; 244#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 245#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 246#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 247#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 248#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 249#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 250#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 251#L516-3 [2024-11-23 02:16:18,234 INFO L747 eck$LassoCheckResult]: Loop: 251#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 252#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 259#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 251#L516-3 [2024-11-23 02:16:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2024-11-23 02:16:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861744243] [2024-11-23 02:16:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-11-23 02:16:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974593329] [2024-11-23 02:16:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2024-11-23 02:16:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098020752] [2024-11-23 02:16:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:18,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:16:18,405 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-11-23 02:16:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098020752] [2024-11-23 02:16:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098020752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231281212] [2024-11-23 02:16:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:18,454 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:16:18,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-23 02:16:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:18,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:16:18,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:18,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231281212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:18,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-23 02:16:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009293574] [2024-11-23 02:16:18,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:16:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:16:18,734 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-11-23 02:16:18,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:18,821 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2024-11-23 02:16:18,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-23 02:16:18,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:18,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2024-11-23 02:16:18,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:18,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:18,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-23 02:16:18,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:18,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:16:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-23 02:16:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-23 02:16:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-23 02:16:18,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-23 02:16:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:16:18,829 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-23 02:16:18,829 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:16:18,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-11-23 02:16:18,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:18,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:18,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:18,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:18,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:18,831 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 393#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_~k~0#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; 379#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 380#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 383#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 381#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 382#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 396#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 397#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 384#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 385#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 386#L516-3 [2024-11-23 02:16:18,831 INFO L747 eck$LassoCheckResult]: Loop: 386#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 387#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 394#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 386#L516-3 [2024-11-23 02:16:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2024-11-23 02:16:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242328934] [2024-11-23 02:16:18,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,850 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:18,850 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:18,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-11-23 02:16:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725719790] [2024-11-23 02:16:18,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:16:18,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:18,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:18,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2024-11-23 02:16:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572818314] [2024-11-23 02:16:18,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:18,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:18,893 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:18,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:18,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:19,242 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:19,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:19,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:19,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:19,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:19,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:19,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:19,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration5_Lasso [2024-11-23 02:16:19,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:19,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:19,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:19,690 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:19,690 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:19,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,694 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:16:19,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:16:19,702 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-11-23 02:16:19,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:16:19,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:16:19,741 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-11-23 02:16:19,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,770 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-11-23 02:16:19,774 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-11-23 02:16:19,775 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-11-23 02:16:19,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:19,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,805 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-11-23 02:16:19,806 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-11-23 02:16:19,807 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-11-23 02:16:19,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-23 02:16:19,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,837 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-11-23 02:16:19,840 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-11-23 02:16:19,841 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-11-23 02:16:19,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:19,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,866 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-11-23 02:16:19,868 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-11-23 02:16:19,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-11-23 02:16:19,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:19,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:19,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:19,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,890 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-11-23 02:16:19,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,892 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-11-23 02:16:19,893 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-11-23 02:16:19,894 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-11-23 02:16:19,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:19,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:19,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:19,932 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-11-23 02:16:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,935 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-11-23 02:16:19,940 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-11-23 02:16:19,941 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-11-23 02:16:19,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:19,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:19,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:19,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:19,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:19,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:19,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:19,985 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:16:19,986 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-23 02:16:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:19,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:19,988 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-11-23 02:16:19,989 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-11-23 02:16:19,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:20,000 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:16:20,000 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:20,000 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~i~0#1) = -2*ULTIMATE.start_bubbleSort_~j~0#1 + 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2024-11-23 02:16:20,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-23 02:16:20,016 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-23 02:16:20,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:20,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:16:20,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:20,072 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-11-23 02:16:20,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 42 transitions. Complement of second has 5 states. [2024-11-23 02:16:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:16:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-23 02:16:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-23 02:16:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-23 02:16:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-23 02:16:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:20,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2024-11-23 02:16:20,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 29 transitions. [2024-11-23 02:16:20,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:20,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:20,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2024-11-23 02:16:20,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:20,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-23 02:16:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2024-11-23 02:16:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-23 02:16:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-23 02:16:20,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-23 02:16:20,095 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-23 02:16:20,095 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:16:20,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2024-11-23 02:16:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:20,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:20,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:20,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:20,096 INFO L745 eck$LassoCheckResult]: Stem: 523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 524#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_~k~0#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; 510#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 511#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 514#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 527#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 528#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 512#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 513#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 515#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 516#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 519#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 520#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 522#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 517#L516-3 [2024-11-23 02:16:20,096 INFO L747 eck$LassoCheckResult]: Loop: 517#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 518#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 525#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 517#L516-3 [2024-11-23 02:16:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2024-11-23 02:16:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515592368] [2024-11-23 02:16:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:20,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515592368] [2024-11-23 02:16:20,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515592368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:20,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422502405] [2024-11-23 02:16:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:20,171 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:16:20,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-23 02:16:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:16:20,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:20,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422502405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:20,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-23 02:16:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508522691] [2024-11-23 02:16:20,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:20,270 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:20,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-11-23 02:16:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952938801] [2024-11-23 02:16:20,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:16:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,274 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:16:20,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:20,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:20,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:16:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:16:20,342 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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-11-23 02:16:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:20,412 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2024-11-23 02:16:20,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2024-11-23 02:16:20,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2024-11-23 02:16:20,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:20,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:20,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2024-11-23 02:16:20,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:20,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-23 02:16:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2024-11-23 02:16:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-11-23 02:16:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-23 02:16:20,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-23 02:16:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:16:20,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-23 02:16:20,416 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:16:20,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-23 02:16:20,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:20,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:20,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:20,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:20,417 INFO L745 eck$LassoCheckResult]: Stem: 664#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 665#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_~k~0#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; 650#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 651#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 652#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 653#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 654#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 668#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 669#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 655#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 656#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 659#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 660#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 667#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 662#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 663#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 661#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 657#L516-3 [2024-11-23 02:16:20,417 INFO L747 eck$LassoCheckResult]: Loop: 657#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 658#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 666#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 657#L516-3 [2024-11-23 02:16:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2024-11-23 02:16:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963720574] [2024-11-23 02:16:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:20,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:20,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-11-23 02:16:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751388660] [2024-11-23 02:16:20,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:16:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,459 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:16:20,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:20,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:20,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2024-11-23 02:16:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845107401] [2024-11-23 02:16:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:16:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845107401] [2024-11-23 02:16:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845107401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735122886] [2024-11-23 02:16:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:20,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:20,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:20,607 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-11-23 02:16:20,611 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-11-23 02:16:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:20,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:16:20,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:16:20,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:16:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735122886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:20,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-23 02:16:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550958798] [2024-11-23 02:16:20,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:20,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:20,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 02:16:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-23 02:16:20,841 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:20,886 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-23 02:16:20,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-11-23 02:16:20,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 28 transitions. [2024-11-23 02:16:20,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:20,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:20,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-23 02:16:20,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:20,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:16:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-23 02:16:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-23 02:16:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-23 02:16:20,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-23 02:16:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:16:20,889 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-23 02:16:20,889 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:16:20,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-23 02:16:20,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:20,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:20,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:20,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:20,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:20,890 INFO L745 eck$LassoCheckResult]: Stem: 846#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 847#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_~k~0#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; 835#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 836#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 837#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 853#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 854#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 838#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 839#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 856#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 855#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 840#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 841#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 844#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 845#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 852#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 849#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 850#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 848#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 842#L516-3 [2024-11-23 02:16:20,890 INFO L747 eck$LassoCheckResult]: Loop: 842#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 843#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 851#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 842#L516-3 [2024-11-23 02:16:20,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2024-11-23 02:16:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772492295] [2024-11-23 02:16:20,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:20,899 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:20,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772492295] [2024-11-23 02:16:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772492295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796075488] [2024-11-23 02:16:21,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:21,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:21,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:21,006 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:16:21,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-23 02:16:21,076 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:21,077 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:21,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:16:21,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:21,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796075488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:21,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-23 02:16:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847970949] [2024-11-23 02:16:21,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:21,203 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-11-23 02:16:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720877153] [2024-11-23 02:16:21,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:16:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:21,213 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:16:21,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:21,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:21,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 02:16:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-23 02:16:21,283 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 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-11-23 02:16:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:21,356 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-23 02:16:21,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2024-11-23 02:16:21,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:21,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2024-11-23 02:16:21,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:16:21,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:16:21,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2024-11-23 02:16:21,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:21,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-23 02:16:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2024-11-23 02:16:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-11-23 02:16:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-11-23 02:16:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-23 02:16:21,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-23 02:16:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:16:21,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-23 02:16:21,363 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:16:21,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-23 02:16:21,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:21,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:21,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:21,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:21,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:21,365 INFO L745 eck$LassoCheckResult]: Stem: 1027#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1028#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_~k~0#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; 1016#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1017#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1018#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1019#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1020#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1035#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1038#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1037#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1036#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1021#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 1022#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1029#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1040#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1039#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1025#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1026#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1034#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1031#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1032#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1030#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1023#L516-3 [2024-11-23 02:16:21,365 INFO L747 eck$LassoCheckResult]: Loop: 1023#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1024#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1033#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1023#L516-3 [2024-11-23 02:16:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2024-11-23 02:16:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591372397] [2024-11-23 02:16:21,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:16:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:21,386 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 02:16:21,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:21,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:21,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2024-11-23 02:16:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550241121] [2024-11-23 02:16:21,405 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:16:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:21,407 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:16:21,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:21,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:21,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:21,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:21,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2024-11-23 02:16:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758683245] [2024-11-23 02:16:21,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:21,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:21,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:21,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-23 02:16:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758683245] [2024-11-23 02:16:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758683245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110956091] [2024-11-23 02:16:21,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:21,740 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:16:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-23 02:16:21,797 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:21,797 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:16:21,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 02:16:21,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:21,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:16:21,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-23 02:16:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 02:16:21,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:21,971 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-23 02:16:21,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 28 [2024-11-23 02:16:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 02:16:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110956091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:22,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 17 [2024-11-23 02:16:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167856156] [2024-11-23 02:16:22,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 02:16:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-23 02:16:22,070 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:22,144 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-23 02:16:22,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2024-11-23 02:16:22,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:16:22,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 57 transitions. [2024-11-23 02:16:22,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-23 02:16:22,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-23 02:16:22,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2024-11-23 02:16:22,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:16:22,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-23 02:16:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2024-11-23 02:16:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-23 02:16:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:16:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-23 02:16:22,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-23 02:16:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:16:22,149 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-23 02:16:22,149 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:16:22,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2024-11-23 02:16:22,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:16:22,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:22,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:22,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:22,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:16:22,150 INFO L745 eck$LassoCheckResult]: Stem: 1269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1270#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_~k~0#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; 1252#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1253#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1256#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1254#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1255#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1274#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1279#L532-3 assume !!(main_~k~0#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_~k~0#1, 4);havoc main_#t~nondet10#1; 1278#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1277#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1257#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 1258#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1263#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1283#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1282#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1261#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1262#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1272#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1273#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1286#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1264#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1266#L516-3 [2024-11-23 02:16:22,150 INFO L747 eck$LassoCheckResult]: Loop: 1266#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1281#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1271#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1266#L516-3 [2024-11-23 02:16:22,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2024-11-23 02:16:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158813294] [2024-11-23 02:16:22,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:16:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:22,179 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 02:16:22,179 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:22,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:22,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:22,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2024-11-23 02:16:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004014928] [2024-11-23 02:16:22,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:16:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:22,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:22,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2024-11-23 02:16:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414210317] [2024-11-23 02:16:22,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:16:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:22,225 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:16:22,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:22,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:22,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:24,394 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:24,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:24,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:24,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:24,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:24,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:24,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:24,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:24,395 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration10_Lasso [2024-11-23 02:16:24,395 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:24,395 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:24,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:25,000 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,010 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-11-23 02:16:25,012 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-11-23 02:16:25,013 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-11-23 02:16:25,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,049 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-11-23 02:16:25,051 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-11-23 02:16:25,052 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-11-23 02:16:25,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,096 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-11-23 02:16:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,099 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-11-23 02:16:25,102 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-11-23 02:16:25,103 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-11-23 02:16:25,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,121 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-11-23 02:16:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,123 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-11-23 02:16:25,126 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-11-23 02:16:25,127 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-11-23 02:16:25,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,150 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-11-23 02:16:25,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,151 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-11-23 02:16:25,153 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-11-23 02:16:25,155 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-11-23 02:16:25,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-23 02:16:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,196 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-11-23 02:16:25,202 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-11-23 02:16:25,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:25,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:25,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:25,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-23 02:16:25,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,258 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-11-23 02:16:25,264 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-11-23 02:16:25,265 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-11-23 02:16:25,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,288 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:16:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-23 02:16:25,290 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-11-23 02:16:25,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,311 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-11-23 02:16:25,312 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-11-23 02:16:25,313 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-11-23 02:16:25,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-23 02:16:25,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,348 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-11-23 02:16:25,349 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-11-23 02:16:25,350 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-11-23 02:16:25,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,374 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-11-23 02:16:25,392 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-11-23 02:16:25,393 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-11-23 02:16:25,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,418 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-11-23 02:16:25,419 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-11-23 02:16:25,420 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-11-23 02:16:25,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:25,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:25,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:25,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,441 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-11-23 02:16:25,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,444 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-11-23 02:16:25,446 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-11-23 02:16:25,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:25,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:25,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:25,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,473 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-11-23 02:16:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,480 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-11-23 02:16:25,481 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-11-23 02:16:25,482 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-11-23 02:16:25,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:25,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:25,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:25,523 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-11-23 02:16:25,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,525 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-11-23 02:16:25,527 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-11-23 02:16:25,528 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-11-23 02:16:25,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:25,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:25,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:25,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:25,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:25,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:25,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:25,619 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-23 02:16:25,620 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-23 02:16:25,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,622 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-11-23 02:16:25,623 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-11-23 02:16:25,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:25,637 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-23 02:16:25,638 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:25,638 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 2147483647*ULTIMATE.start_bubbleSort_~i~0#1 - 1*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2 + 4294967292*ULTIMATE.start_bubbleSort_~j~0#1 >= 0] [2024-11-23 02:16:25,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:25,665 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-11-23 02:16:25,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:25,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 02:16:25,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:25,843 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-11-23 02:16:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:25,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:16:25,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:25,982 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-11-23 02:16:25,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 48 states and 68 transitions. Complement of second has 7 states. [2024-11-23 02:16:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:16:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-23 02:16:26,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-23 02:16:26,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,027 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:16:26,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,079 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-11-23 02:16:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:26,196 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-11-23 02:16:26,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 48 states and 68 transitions. Complement of second has 7 states. [2024-11-23 02:16:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:16:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-23 02:16:26,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-23 02:16:26,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,257 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:16:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,306 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-11-23 02:16:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:16:26,402 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-11-23 02:16:26,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 48 states and 70 transitions. Complement of second has 6 states. [2024-11-23 02:16:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:16:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11-23 02:16:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-11-23 02:16:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-23 02:16:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-23 02:16:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 6 letters. [2024-11-23 02:16:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 70 transitions. [2024-11-23 02:16:26,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:16:26,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:16:26,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:16:26,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:26,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:16:26,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:16:26,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:16:26,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:16:26,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:16:26 BoogieIcfgContainer [2024-11-23 02:16:26,456 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:16:26,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:16:26,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:16:26,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:16:26,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:15" (3/4) ... [2024-11-23 02:16:26,459 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:16:26,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:16:26,460 INFO L158 Benchmark]: Toolchain (without parser) took 11795.55ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 91.5MB in the beginning and 148.8MB in the end (delta: -57.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,461 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:16:26,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.74ms. Allocated memory is still 148.9MB. Free memory was 91.5MB in the beginning and 72.5MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 148.9MB. Free memory was 72.5MB in the beginning and 70.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,461 INFO L158 Benchmark]: Boogie Preprocessor took 41.05ms. Allocated memory is still 148.9MB. Free memory was 70.7MB in the beginning and 68.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,462 INFO L158 Benchmark]: RCFGBuilder took 375.37ms. Allocated memory is still 148.9MB. Free memory was 68.8MB in the beginning and 108.9MB in the end (delta: -40.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,462 INFO L158 Benchmark]: BuchiAutomizer took 10897.60ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 108.9MB in the beginning and 148.8MB in the end (delta: -39.9MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-11-23 02:16:26,462 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 276.8MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:16:26,463 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.21ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.74ms. Allocated memory is still 148.9MB. Free memory was 91.5MB in the beginning and 72.5MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 148.9MB. Free memory was 72.5MB in the beginning and 70.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.05ms. Allocated memory is still 148.9MB. Free memory was 70.7MB in the beginning and 68.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.37ms. Allocated memory is still 148.9MB. Free memory was 68.8MB in the beginning and 108.9MB in the end (delta: -40.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 10897.60ms. Allocated memory was 148.9MB in the beginning and 276.8MB in the end (delta: 127.9MB). Free memory was 108.9MB in the beginning and 148.8MB in the end (delta: -39.9MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 276.8MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (array_size + ((long long) -1 * k)) and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * i) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((((long long) 2 * i) + ((long long) -2 * j)) + 1) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + ((long long) 2147483647 * i)) and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 9.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 119 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT1 lasso3 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax178 hnf100 lsp68 ukn75 mio100 lsp72 div127 bol100 ite100 ukn100 eq170 hnf92 smp90 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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-11-23 02:16:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:26,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:26,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:27,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-23 02:16:27,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-23 02:16:27,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:27,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE