./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 23:54:04,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 23:54:04,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-24 23:54:04,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 23:54:04,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 23:54:04,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 23:54:04,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 23:54:04,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 23:54:04,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 23:54:04,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 23:54:04,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 23:54:04,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 23:54:04,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 23:54:04,528 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-24 23:54:04,529 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-24 23:54:04,529 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-24 23:54:04,529 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-24 23:54:04,529 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-24 23:54:04,530 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-24 23:54:04,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 23:54:04,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-24 23:54:04,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 23:54:04,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 23:54:04,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-24 23:54:04,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-24 23:54:04,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-24 23:54:04,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 23:54:04,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 23:54:04,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 23:54:04,534 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-24 23:54:04,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 23:54:04,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 23:54:04,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 23:54:04,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 23:54:04,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 23:54:04,537 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-24 23:54:04,537 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f [2024-10-24 23:54:04,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 23:54:04,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 23:54:04,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 23:54:04,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 23:54:04,802 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 23:54:04,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-10-24 23:54:06,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 23:54:06,466 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 23:54:06,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2024-10-24 23:54:06,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845834fa1/fb2db4a5a34e4db0a2eb8201bbe957b6/FLAGcfb706f04 [2024-10-24 23:54:06,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845834fa1/fb2db4a5a34e4db0a2eb8201bbe957b6 [2024-10-24 23:54:06,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 23:54:06,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 23:54:06,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 23:54:06,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 23:54:06,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 23:54:06,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:06,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1de4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06, skipping insertion in model container [2024-10-24 23:54:06,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:06,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 23:54:06,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:54:06,859 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 23:54:06,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:54:06,922 INFO L204 MainTranslator]: Completed translation [2024-10-24 23:54:06,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06 WrapperNode [2024-10-24 23:54:06,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 23:54:06,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 23:54:06,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 23:54:06,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 23:54:06,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:06,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,011 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-10-24 23:54:07,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 23:54:07,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 23:54:07,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 23:54:07,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 23:54:07,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,043 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-24 23:54:07,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 23:54:07,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 23:54:07,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 23:54:07,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 23:54:07,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (1/1) ... [2024-10-24 23:54:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:07,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:07,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-24 23:54:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 23:54:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 23:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 23:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 23:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 23:54:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 23:54:07,275 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 23:54:07,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 23:54:07,392 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 23:54:07,392 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 23:54:07,402 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 23:54:07,403 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 23:54:07,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:07 BoogieIcfgContainer [2024-10-24 23:54:07,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 23:54:07,404 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-24 23:54:07,404 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-24 23:54:07,408 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-24 23:54:07,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:07,409 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.10 11:54:06" (1/3) ... [2024-10-24 23:54:07,409 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c268214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:54:07, skipping insertion in model container [2024-10-24 23:54:07,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:07,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:06" (2/3) ... [2024-10-24 23:54:07,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c268214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:54:07, skipping insertion in model container [2024-10-24 23:54:07,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:07,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:07" (3/3) ... [2024-10-24 23:54:07,412 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2024-10-24 23:54:07,453 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-24 23:54:07,454 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-24 23:54:07,454 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-24 23:54:07,454 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-24 23:54:07,454 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-24 23:54:07,454 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-24 23:54:07,454 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-24 23:54:07,454 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-24 23:54:07,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:07,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:54:07,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:07,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:07,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-24 23:54:07,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:07,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-24 23:54:07,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:07,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:54:07,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:07,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:07,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-24 23:54:07,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:07,484 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#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_~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; 11#L562true assume !(main_~array_size~0#1 < 1); 13#L562-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 5#L550-3true [2024-10-24 23:54:07,485 INFO L747 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 4#L551-3true assume !true; 12#L550-2true bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 5#L550-3true [2024-10-24 23:54:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-24 23:54:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762125265] [2024-10-24 23:54:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2024-10-24 23:54:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003404894] [2024-10-24 23:54:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003404894] [2024-10-24 23:54:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003404894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:54:07,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:54:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 23:54:07,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116330295] [2024-10-24 23:54:07,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:54:07,665 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-24 23:54:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 23:54:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 23:54:07,691 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) 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) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:07,696 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-24 23:54:07,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-24 23:54:07,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:54:07,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2024-10-24 23:54:07,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-24 23:54:07,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-24 23:54:07,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2024-10-24 23:54:07,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:54:07,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-24 23:54:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2024-10-24 23:54:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-24 23:54:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2024-10-24 23:54:07,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-24 23:54:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 23:54:07,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-24 23:54:07,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-24 23:54:07,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2024-10-24 23:54:07,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:54:07,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:07,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:07,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-24 23:54:07,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:07,725 INFO L745 eck$LassoCheckResult]: Stem: 36#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#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_~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; 40#L562 assume !(main_~array_size~0#1 < 1); 41#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 42#L550-3 [2024-10-24 23:54:07,726 INFO L747 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 35#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 38#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 42#L550-3 [2024-10-24 23:54:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2024-10-24 23:54:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108921405] [2024-10-24 23:54:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:07,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2024-10-24 23:54:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044179440] [2024-10-24 23:54:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:07,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2024-10-24 23:54:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:07,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377820121] [2024-10-24 23:54:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:07,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:07,864 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:07,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:07,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:07,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:07,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-24 23:54:07,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:07,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:07,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:07,867 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-10-24 23:54:07,867 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:07,867 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:07,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:07,997 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:07,997 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-24 23:54:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-24 23:54:08,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-24 23:54:08,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-24 23:54:08,027 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-24 23:54:08,028 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-10-24 23:54:08,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-24 23:54:08,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-24 23:54:08,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-24 23:54:08,068 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-24 23:54:08,069 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-10-24 23:54:08,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-24 23:54:08,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-24 23:54:08,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-24 23:54:08,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-24 23:54:08,121 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-10-24 23:54:08,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-24 23:54:08,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-24 23:54:08,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-24 23:54:08,145 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-24 23:54:08,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:08,158 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:08,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:08,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:08,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:08,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:08,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:08,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:08,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2024-10-24 23:54:08,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:08,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:08,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:08,263 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:08,268 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-24 23:54:08,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:08,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:08,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:08,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:08,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:08,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:08,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:08,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:08,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:08,306 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-10-24 23:54:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-24 23:54:08,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:08,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:08,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:08,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:08,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:08,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:08,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:08,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:08,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:08,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:08,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-24 23:54:08,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:08,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:08,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:08,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:08,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:08,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:08,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:08,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:08,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:08,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-24 23:54:08,361 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-24 23:54:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:08,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:08,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-24 23:54:08,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:08,386 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-24 23:54:08,386 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:08,387 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-10-24 23:54:08,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-24 23:54:08,400 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-24 23:54:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:08,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:08,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:08,468 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 23:54:08,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:08,503 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:08,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:08,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 22 transitions. Complement of second has 4 states. [2024-10-24 23:54:08,549 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-10-24 23:54:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-10-24 23:54:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2024-10-24 23:54:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-24 23:54:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-24 23:54:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:08,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2024-10-24 23:54:08,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:08,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2024-10-24 23:54:08,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-24 23:54:08,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-24 23:54:08,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2024-10-24 23:54:08,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:08,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-24 23:54:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2024-10-24 23:54:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-24 23:54:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-10-24 23:54:08,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-24 23:54:08,563 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-24 23:54:08,563 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-24 23:54:08,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-10-24 23:54:08,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:08,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:08,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:08,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-24 23:54:08,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:08,566 INFO L745 eck$LassoCheckResult]: Stem: 105#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 106#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_~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; 107#L562 assume !(main_~array_size~0#1 < 1); 108#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 109#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 99#L551-3 [2024-10-24 23:54:08,566 INFO L747 eck$LassoCheckResult]: Loop: 99#L551-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); 102#L552 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); 98#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 99#L551-3 [2024-10-24 23:54:08,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2024-10-24 23:54:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809928789] [2024-10-24 23:54:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:08,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2024-10-24 23:54:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:08,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837324869] [2024-10-24 23:54:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:08,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2024-10-24 23:54:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182434468] [2024-10-24 23:54:08,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:08,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:08,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-24 23:54:09,037 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:09,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:09,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:09,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:09,038 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:09,038 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,038 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:09,038 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:09,038 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2024-10-24 23:54:09,038 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:09,038 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:09,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:09,545 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:09,545 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:09,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,548 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-10-24 23:54:09,549 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-10-24 23:54:09,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,583 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-10-24 23:54:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,586 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-24 23:54:09,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-24 23:54:09,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,646 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-24 23:54:09,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-24 23:54:09,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,721 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-24 23:54:09,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-24 23:54:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-24 23:54:09,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-24 23:54:09,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,794 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-24 23:54:09,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,831 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-10-24 23:54:09,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,833 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-24 23:54:09,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-24 23:54:09,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,873 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-24 23:54:09,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:09,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:09,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:09,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,908 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-10-24 23:54:09,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,910 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-24 23:54:09,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:09,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:09,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,945 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-10-24 23:54:09,946 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-10-24 23:54:09,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:09,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:09,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:09,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:09,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:09,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:09,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:09,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:09,996 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-24 23:54:09,996 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-24 23:54:09,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,999 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-10-24 23:54:10,007 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-10-24 23:54:10,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:10,024 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-24 23:54:10,024 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:10,024 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 3*ULTIMATE.start_bubbleSort_~i~0#1 - 2*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [1*ULTIMATE.start_bubbleSort_~j~0#1 - 1 >= 0] [2024-10-24 23:54:10,038 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-10-24 23:54:10,054 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-10-24 23:54:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:10,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 23:54:10,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:10,133 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-10-24 23:54:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:10,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 23:54:10,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:10,176 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:10,176 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 5 states. [2024-10-24 23:54:10,223 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-10-24 23:54:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-24 23:54:10,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-24 23:54:10,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:10,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2024-10-24 23:54:10,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:10,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2024-10-24 23:54:10,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:10,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2024-10-24 23:54:10,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 23 transitions. [2024-10-24 23:54:10,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-24 23:54:10,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-24 23:54:10,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2024-10-24 23:54:10,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:10,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-24 23:54:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2024-10-24 23:54:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2024-10-24 23:54:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-24 23:54:10,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:54:10,230 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:54:10,230 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-24 23:54:10,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-24 23:54:10,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:10,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:10,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-24 23:54:10,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:10,231 INFO L745 eck$LassoCheckResult]: Stem: 211#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 212#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_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 215#L562 assume !(main_~array_size~0#1 < 1); 216#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 213#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 207#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 209#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 214#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 205#L551-3 [2024-10-24 23:54:10,231 INFO L747 eck$LassoCheckResult]: Loop: 205#L551-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); 208#L552 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); 204#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 205#L551-3 [2024-10-24 23:54:10,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2024-10-24 23:54:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896574885] [2024-10-24 23:54:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:10,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896574885] [2024-10-24 23:54:10,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896574885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:54:10,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:54:10,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 23:54:10,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433880169] [2024-10-24 23:54:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:54:10,321 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:54:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2024-10-24 23:54:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067077883] [2024-10-24 23:54:10,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 23:54:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 23:54:10,436 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:10,457 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2024-10-24 23:54:10,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-10-24 23:54:10,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2024-10-24 23:54:10,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-24 23:54:10,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-24 23:54:10,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-10-24 23:54:10,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:10,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-10-24 23:54:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-10-24 23:54:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2024-10-24 23:54:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-24 23:54:10,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-24 23:54:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 23:54:10,462 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-24 23:54:10,463 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-24 23:54:10,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-24 23:54:10,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:10,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:10,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 23:54:10,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:10,464 INFO L745 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#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_~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; 255#L562 assume !(main_~array_size~0#1 < 1); 256#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 257#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 253#L551-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); 254#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 248#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 249#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 259#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 258#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 247#L551-3 [2024-10-24 23:54:10,464 INFO L747 eck$LassoCheckResult]: Loop: 247#L551-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#L552 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); 246#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 247#L551-3 [2024-10-24 23:54:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2024-10-24 23:54:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591260416] [2024-10-24 23:54:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2024-10-24 23:54:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635224001] [2024-10-24 23:54:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2024-10-24 23:54:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806985892] [2024-10-24 23:54:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806985892] [2024-10-24 23:54:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806985892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:54:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819726328] [2024-10-24 23:54:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:54:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:10,639 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 23:54:10,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-24 23:54:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:10,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 23:54:10,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:10,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 23:54:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819726328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 23:54:10,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 23:54:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-24 23:54:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109418112] [2024-10-24 23:54:10,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 23:54:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 23:54:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 23:54:10,881 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:10,916 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-10-24 23:54:10,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2024-10-24 23:54:10,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2024-10-24 23:54:10,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-24 23:54:10,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-24 23:54:10,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2024-10-24 23:54:10,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:10,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-24 23:54:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2024-10-24 23:54:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2024-10-24 23:54:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-10-24 23:54:10,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-24 23:54:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 23:54:10,920 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-24 23:54:10,921 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-24 23:54:10,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-10-24 23:54:10,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:10,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:10,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:10,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 23:54:10,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:10,922 INFO L745 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#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_~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; 390#L562 assume !(main_~array_size~0#1 < 1); 391#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 392#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 393#L551-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); 398#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 384#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 385#L551-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); 389#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 395#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 397#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 396#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 394#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 383#L551-3 [2024-10-24 23:54:10,922 INFO L747 eck$LassoCheckResult]: Loop: 383#L551-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); 388#L552 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); 382#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 383#L551-3 [2024-10-24 23:54:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2024-10-24 23:54:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685292585] [2024-10-24 23:54:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2024-10-24 23:54:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373813503] [2024-10-24 23:54:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2024-10-24 23:54:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67469862] [2024-10-24 23:54:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67469862] [2024-10-24 23:54:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67469862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:54:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355520656] [2024-10-24 23:54:11,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 23:54:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:54:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:11,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 23:54:11,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-24 23:54:11,517 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 23:54:11,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 23:54:11,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 23:54:11,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:11,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 23:54:11,610 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-10-24 23:54:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 23:54:11,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 23:54:11,728 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-10-24 23:54:11,728 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-10-24 23:54:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 23:54:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355520656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 23:54:11,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 23:54:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2024-10-24 23:54:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136272310] [2024-10-24 23:54:11,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 23:54:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 23:54:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-24 23:54:11,865 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:11,968 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-10-24 23:54:11,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2024-10-24 23:54:11,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-24 23:54:11,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2024-10-24 23:54:11,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-24 23:54:11,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-24 23:54:11,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2024-10-24 23:54:11,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:11,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-24 23:54:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2024-10-24 23:54:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-10-24 23:54:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-24 23:54:11,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-24 23:54:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 23:54:11,978 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-24 23:54:11,978 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-24 23:54:11,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2024-10-24 23:54:11,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-24 23:54:11,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:11,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:11,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 23:54:11,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:54:11,980 INFO L745 eck$LassoCheckResult]: Stem: 559#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 560#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_~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; 564#L562 assume !(main_~array_size~0#1 < 1); 565#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;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; 566#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 567#L551-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); 577#L552 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 557#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 558#L551-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); 563#L552 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); 570#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 576#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 572#L550-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 573#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 556#L551-3 [2024-10-24 23:54:11,980 INFO L747 eck$LassoCheckResult]: Loop: 556#L551-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); 580#L552 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); 555#L551-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 556#L551-3 [2024-10-24 23:54:11,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2024-10-24 23:54:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251090910] [2024-10-24 23:54:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:12,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2024-10-24 23:54:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078079227] [2024-10-24 23:54:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2024-10-24 23:54:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911037137] [2024-10-24 23:54:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:12,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:12,595 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:12,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:12,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:12,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:12,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:12,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:12,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:12,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2024-10-24 23:54:12,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:12,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:12,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:12,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:13,089 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:13,092 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,094 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-24 23:54:13,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:13,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:13,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:13,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,126 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-10-24 23:54:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,128 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-24 23:54:13,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:13,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:13,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:13,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,167 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-24 23:54:13,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-24 23:54:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,205 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-24 23:54:13,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,243 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-24 23:54:13,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,295 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-10-24 23:54:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,298 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-24 23:54:13,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,341 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-24 23:54:13,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:13,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,378 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-24 23:54:13,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:54:13,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:13,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:13,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:13,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:13,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:13,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:13,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:13,432 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-24 23:54:13,432 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-24 23:54:13,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:13,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:13,434 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:54:13,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-24 23:54:13,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:13,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:54:13,450 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:13,450 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 - 2*ULTIMATE.start_bubbleSort_~j~0#1 + 1 Supporting invariants [] [2024-10-24 23:54:13,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:13,475 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-24 23:54:13,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:13,556 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:13,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,576 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 42 states and 60 transitions. Complement of second has 5 states. [2024-10-24 23:54:13,578 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-10-24 23:54:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-24 23:54:13,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-24 23:54:13,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,579 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-24 23:54:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:13,658 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:13,658 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 42 states and 60 transitions. Complement of second has 5 states. [2024-10-24 23:54:13,677 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-10-24 23:54:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-24 23:54:13,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-24 23:54:13,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,680 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-24 23:54:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 23:54:13,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:13,756 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:13,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,775 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 37 states and 54 transitions. Complement of second has 4 states. [2024-10-24 23:54:13,775 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-10-24 23:54:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:54:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-10-24 23:54:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-24 23:54:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-24 23:54:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-24 23:54:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2024-10-24 23:54:13,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:54:13,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-24 23:54:13,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-24 23:54:13,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:54:13,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-24 23:54:13,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-24 23:54:13,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:54:13,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-24 23:54:13,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 24.10 11:54:13 BoogieIcfgContainer [2024-10-24 23:54:13,786 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-24 23:54:13,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 23:54:13,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 23:54:13,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 23:54:13,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:07" (3/4) ... [2024-10-24 23:54:13,789 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 23:54:13,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 23:54:13,791 INFO L158 Benchmark]: Toolchain (without parser) took 7281.98ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 93.2MB in the beginning and 117.9MB in the end (delta: -24.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-24 23:54:13,791 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:54:13,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.76ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 74.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 23:54:13,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.19ms. Allocated memory is still 163.6MB. Free memory was 74.7MB in the beginning and 134.6MB in the end (delta: -59.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 23:54:13,792 INFO L158 Benchmark]: Boogie Preprocessor took 44.67ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 132.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:54:13,792 INFO L158 Benchmark]: RCFGBuilder took 345.66ms. Allocated memory is still 163.6MB. Free memory was 132.5MB in the beginning and 120.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 23:54:13,792 INFO L158 Benchmark]: BuchiAutomizer took 6382.11ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 120.8MB in the beginning and 117.9MB in the end (delta: 2.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-10-24 23:54:13,793 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 197.1MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:54:13,794 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.44ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.76ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 74.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.19ms. Allocated memory is still 163.6MB. Free memory was 74.7MB in the beginning and 134.6MB in the end (delta: -59.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.67ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 132.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.66ms. Allocated memory is still 163.6MB. Free memory was 132.5MB in the beginning and 120.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6382.11ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 120.8MB in the beginning and 117.9MB in the end (delta: 2.8MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 197.1MB. Free memory is still 117.9MB. 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 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) 2 * i) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long) 3 * i) + ((long) -2 * j)) and consists of 3 locations. One nondeterministic module has affine ranking function ((((long) 2 * i) + ((long) -2 * j)) + 1) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 83 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital94 mio100 ax195 hnf100 lsp63 ukn79 mio100 lsp77 div133 bol100 ite100 ukn100 eq175 hnf92 smp84 dnf100 smp100 tf105 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-24 23:54:13,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-24 23:54:14,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:14,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:14,422 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