./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.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 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:22:59,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:22:59,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:22:59,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:22:59,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:22:59,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:22:59,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:22:59,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:22:59,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:22:59,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:22:59,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:22:59,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:22:59,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:22:59,497 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:22:59,498 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:22:59,498 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:22:59,498 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:22:59,499 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:22:59,499 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:22:59,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:22:59,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:22:59,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:22:59,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:22:59,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:22:59,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:22:59,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:22:59,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:22:59,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:22:59,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:22:59,506 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:22:59,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:22:59,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:22:59,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:22:59,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:22:59,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:22:59,512 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:22:59,513 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 -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2024-11-19 14:22:59,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:22:59,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:22:59,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:22:59,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:22:59,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:22:59,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-11-19 14:23:01,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:23:01,380 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:23:01,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-11-19 14:23:01,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7735ada/00c6a1e7be8940f6b99bd78ea5e1e5a3/FLAG7100b1d18 [2024-11-19 14:23:01,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7735ada/00c6a1e7be8940f6b99bd78ea5e1e5a3 [2024-11-19 14:23:01,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:23:01,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:23:01,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:01,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:23:01,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:23:01,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b5eb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01, skipping insertion in model container [2024-11-19 14:23:01,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:23:01,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:01,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:23:01,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:01,666 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:23:01,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01 WrapperNode [2024-11-19 14:23:01,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:01,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:01,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:23:01,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:23:01,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,698 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-11-19 14:23:01,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:01,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:23:01,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:23:01,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:23:01,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,725 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 3 writes are split as follows [3]. [2024-11-19 14:23:01,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:23:01,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:23:01,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:23:01,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:23:01,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (1/1) ... [2024-11-19 14:23:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:01,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:01,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:01,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:23:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:23:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:23:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-11-19 14:23:01,833 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-11-19 14:23:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:23:01,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:23:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:23:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:23:01,895 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:23:01,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:23:02,029 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 14:23:02,029 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:23:02,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:23:02,040 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:23:02,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:02 BoogieIcfgContainer [2024-11-19 14:23:02,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:23:02,041 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:23:02,041 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:23:02,045 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:23:02,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:02,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:23:01" (1/3) ... [2024-11-19 14:23:02,046 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@148ba51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:02, skipping insertion in model container [2024-11-19 14:23:02,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:02,047 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:01" (2/3) ... [2024-11-19 14:23:02,047 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@148ba51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:02, skipping insertion in model container [2024-11-19 14:23:02,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:02,048 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:02" (3/3) ... [2024-11-19 14:23:02,049 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2024-11-19 14:23:02,105 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:23:02,105 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:23:02,105 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:23:02,105 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:23:02,105 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:23:02,105 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:23:02,106 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:23:02,106 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:23:02,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 14:23:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-19 14:23:02,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:02,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:02,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:23:02,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:02,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:23:02,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 14:23:02,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-19 14:23:02,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:02,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:02,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:23:02,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:02,139 INFO L745 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 17#L28true assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 20#L33-3true [2024-11-19 14:23:02,140 INFO L747 eck$LassoCheckResult]: Loop: 20#L33-3true assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 7#L33-2true main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 20#L33-3true [2024-11-19 14:23:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2024-11-19 14:23:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201694913] [2024-11-19 14:23:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-11-19 14:23:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23094465] [2024-11-19 14:23:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2024-11-19 14:23:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328309808] [2024-11-19 14:23:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:02,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:02,685 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:02,686 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:02,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:02,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:02,686 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:02,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:02,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:02,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:02,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2024-11-19 14:23:02,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:02,687 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:02,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:02,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:03,136 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:03,140 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:03,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:03,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:23:03,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:03,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:03,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:03,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:03,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:03,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:03,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:03,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:03,221 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-19 14:23:03,222 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-19 14:23:03,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:03,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:23:03,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:03,263 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:03,264 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:03,264 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-19 14:23:03,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:23:03,281 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:23:03,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:03,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:23:03,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:03,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:23:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:03,407 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:23:03,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:03,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 44 states and 57 transitions. Complement of second has 7 states. [2024-11-19 14:23:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-19 14:23:03,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-19 14:23:03,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:03,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-19 14:23:03,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:03,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:23:03,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:03,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-11-19 14:23:03,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:03,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 16 states and 21 transitions. [2024-11-19 14:23:03,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:23:03,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:23:03,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-19 14:23:03,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:03,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-19 14:23:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-19 14:23:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 14:23:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-11-19 14:23:03,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-19 14:23:03,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-19 14:23:03,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:23:03,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-11-19 14:23:03,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:03,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:03,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:03,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:23:03,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:23:03,536 INFO L745 eck$LassoCheckResult]: Stem: 125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 120#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 124#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 110#L33-4 havoc main_~i~0#1; 111#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 112#$Ultimate##0 [2024-11-19 14:23:03,536 INFO L747 eck$LassoCheckResult]: Loop: 112#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 114#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 116#L15-6 assume !true; 121#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 113#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 112#$Ultimate##0 [2024-11-19 14:23:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 1 times [2024-11-19 14:23:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253147837] [2024-11-19 14:23:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:03,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-11-19 14:23:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253147837] [2024-11-19 14:23:03,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253147837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:03,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:03,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691168677] [2024-11-19 14:23:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:03,666 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 28740468, now seen corresponding path program 1 times [2024-11-19 14:23:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472884586] [2024-11-19 14:23:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472884586] [2024-11-19 14:23:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472884586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:23:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417002077] [2024-11-19 14:23:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:03,697 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:23:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:23:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:23:03,704 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:03,710 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-11-19 14:23:03,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-11-19 14:23:03,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:03,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-11-19 14:23:03,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:23:03,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:23:03,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-11-19 14:23:03,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:03,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:23:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-11-19 14:23:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 14:23:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-19 14:23:03,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:23:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:23:03,721 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:23:03,721 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:23:03,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-19 14:23:03,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:03,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:03,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:03,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:23:03,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:03,725 INFO L745 eck$LassoCheckResult]: Stem: 163#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 158#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 162#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 148#L33-4 havoc main_~i~0#1; 149#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 150#$Ultimate##0 [2024-11-19 14:23:03,725 INFO L747 eck$LassoCheckResult]: Loop: 150#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 152#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 154#L15-6 #t~short3 := ~j~0 > 0; 159#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 160#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 161#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 151#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 150#$Ultimate##0 [2024-11-19 14:23:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 2 times [2024-11-19 14:23:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493916142] [2024-11-19 14:23:03,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:03,741 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:03,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493916142] [2024-11-19 14:23:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493916142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:03,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:03,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025772086] [2024-11-19 14:23:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:03,796 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 1 times [2024-11-19 14:23:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544930616] [2024-11-19 14:23:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:03,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:03,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:04,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:23:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:23:04,254 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:04,263 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-19 14:23:04,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-19 14:23:04,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:04,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-11-19 14:23:04,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:23:04,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:23:04,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-11-19 14:23:04,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:04,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-19 14:23:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-11-19 14:23:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-19 14:23:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-19 14:23:04,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-19 14:23:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:23:04,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-19 14:23:04,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:23:04,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-19 14:23:04,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:04,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:04,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:04,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:04,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:04,271 INFO L745 eck$LassoCheckResult]: Stem: 202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 197#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 201#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 194#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 195#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 187#L33-4 havoc main_~i~0#1; 188#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 189#$Ultimate##0 [2024-11-19 14:23:04,271 INFO L747 eck$LassoCheckResult]: Loop: 189#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 191#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 193#L15-6 #t~short3 := ~j~0 > 0; 198#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 199#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 200#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 190#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 189#$Ultimate##0 [2024-11-19 14:23:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1034772399, now seen corresponding path program 1 times [2024-11-19 14:23:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634180107] [2024-11-19 14:23:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 2 times [2024-11-19 14:23:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619655909] [2024-11-19 14:23:04,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:04,302 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:04,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:04,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash 231564989, now seen corresponding path program 1 times [2024-11-19 14:23:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685922643] [2024-11-19 14:23:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:23:04,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:04,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685922643] [2024-11-19 14:23:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685922643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 14:23:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224135025] [2024-11-19 14:23:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:04,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:23:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:23:04,849 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:04,906 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-19 14:23:04,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-11-19 14:23:04,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:04,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2024-11-19 14:23:04,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:23:04,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:23:04,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2024-11-19 14:23:04,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:04,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-19 14:23:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2024-11-19 14:23:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-11-19 14:23:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-19 14:23:04,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 14:23:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:23:04,911 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 14:23:04,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:23:04,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-11-19 14:23:04,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:04,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:04,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:04,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:04,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:04,913 INFO L745 eck$LassoCheckResult]: Stem: 257#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 251#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 256#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 248#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 249#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 244#L33-4 havoc main_~i~0#1; 242#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 241#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 243#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 258#L15-6 #t~short3 := ~j~0 > 0; 252#L15-1 assume !#t~short3; 253#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 254#L15-7 [2024-11-19 14:23:04,913 INFO L747 eck$LassoCheckResult]: Loop: 254#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 246#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 255#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 261#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 247#L15-6 #t~short3 := ~j~0 > 0; 260#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 259#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 254#L15-7 [2024-11-19 14:23:04,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1921544551, now seen corresponding path program 1 times [2024-11-19 14:23:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473669125] [2024-11-19 14:23:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:04,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 3 times [2024-11-19 14:23:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501868543] [2024-11-19 14:23:04,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,955 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:04,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:04,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:04,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 61906447, now seen corresponding path program 1 times [2024-11-19 14:23:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643392411] [2024-11-19 14:23:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:05,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643392411] [2024-11-19 14:23:05,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643392411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062784120] [2024-11-19 14:23:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:05,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:05,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 14:23:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:05,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 14:23:05,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:05,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062784120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:05,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:05,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-11-19 14:23:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712044344] [2024-11-19 14:23:05,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:23:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:23:06,020 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:06,123 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-19 14:23:06,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-11-19 14:23:06,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:06,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 27 transitions. [2024-11-19 14:23:06,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:23:06,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:23:06,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-11-19 14:23:06,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:06,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-19 14:23:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-11-19 14:23:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-19 14:23:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-19 14:23:06,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-19 14:23:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:23:06,128 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-19 14:23:06,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:23:06,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2024-11-19 14:23:06,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:23:06,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:06,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:06,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:06,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:06,130 INFO L745 eck$LassoCheckResult]: Stem: 456#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 450#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 455#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 457#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 458#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 447#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 448#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 443#L33-4 havoc main_~i~0#1; 441#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 440#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 442#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 459#L15-6 #t~short3 := ~j~0 > 0; 451#L15-1 assume !#t~short3; 452#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 453#L15-7 [2024-11-19 14:23:06,130 INFO L747 eck$LassoCheckResult]: Loop: 453#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 445#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 454#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 462#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 446#L15-6 #t~short3 := ~j~0 > 0; 461#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 460#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 453#L15-7 [2024-11-19 14:23:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1188957467, now seen corresponding path program 2 times [2024-11-19 14:23:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151248975] [2024-11-19 14:23:06,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,143 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:06,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:06,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:06,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 4 times [2024-11-19 14:23:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703682853] [2024-11-19 14:23:06,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,160 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:06,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:06,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:06,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1611060915, now seen corresponding path program 2 times [2024-11-19 14:23:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198879202] [2024-11-19 14:23:06,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:06,201 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:06,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:07,239 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:07,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:07,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:07,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:07,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:07,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:07,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:07,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:07,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2024-11-19 14:23:07,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:07,241 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:07,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:08,386 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:08,386 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:23:08,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:23:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:23:08,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:23:08,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:23:08,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:23:08,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:23:08,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:23:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:23:08,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,584 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-11-19 14:23:08,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,586 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:23:08,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:23:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,612 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:23:08,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:08,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:08,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:23:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,640 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:23:08,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:08,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:08,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:23:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:23:08,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,697 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:23:08,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,702 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:23:08,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:08,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:23:08,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:23:08,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:08,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:08,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,772 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-11-19 14:23:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:23:08,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:08,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:08,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:08,867 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-19 14:23:08,867 INFO L444 ModelExtractionUtils]: 1 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. [2024-11-19 14:23:08,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,869 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:23:08,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:08,881 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-19 14:23:08,881 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:08,882 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [1*insertionSort_~array.offset - 1*v_rep(select #length insertionSort_#in~array.base)_1 + 8 >= 0] [2024-11-19 14:23:08,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:23:08,905 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:23:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:08,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:23:08,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:08,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 14:23:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:09,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 14:23:09,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:09,324 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2024-11-19 14:23:09,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:09,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 23 states. [2024-11-19 14:23:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 8 stem states 4 non-accepting loop states 2 accepting loop states [2024-11-19 14:23:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2024-11-19 14:23:09,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-19 14:23:09,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 22 letters. Loop has 7 letters. [2024-11-19 14:23:09,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 14 letters. [2024-11-19 14:23:09,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2024-11-19 14:23:09,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:09,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 51 states and 60 transitions. [2024-11-19 14:23:09,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-19 14:23:09,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-19 14:23:09,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2024-11-19 14:23:09,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:09,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-19 14:23:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2024-11-19 14:23:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-11-19 14:23:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-19 14:23:09,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-19 14:23:09,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-19 14:23:09,526 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:23:09,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-19 14:23:09,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:09,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:09,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:09,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:09,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:09,528 INFO L745 eck$LassoCheckResult]: Stem: 704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 693#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 703#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 690#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 691#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 705#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 717#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 718#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 719#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 716#L33-4 havoc main_~i~0#1; 678#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 677#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 679#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 722#L15-6 #t~short3 := ~j~0 > 0; 721#L15-1 assume !#t~short3; 720#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 694#L15-7 [2024-11-19 14:23:09,528 INFO L747 eck$LassoCheckResult]: Loop: 694#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 686#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 696#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 706#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 687#L15-6 #t~short3 := ~j~0 > 0; 697#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 698#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 694#L15-7 [2024-11-19 14:23:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1084158749, now seen corresponding path program 3 times [2024-11-19 14:23:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857404810] [2024-11-19 14:23:09,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:09,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:09,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:09,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 5 times [2024-11-19 14:23:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804729340] [2024-11-19 14:23:09,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,557 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:09,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:09,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:09,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1280040203, now seen corresponding path program 3 times [2024-11-19 14:23:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036912922] [2024-11-19 14:23:09,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:09,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:09,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:09,951 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-11-19 14:23:10,705 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:10,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:10,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:10,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:10,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:10,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:10,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:10,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:10,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2024-11-19 14:23:10,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:10,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:10,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:10,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:11,786 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:11,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,791 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:23:11,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:11,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,823 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-11-19 14:23:11,824 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-11-19 14:23:11,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:23:11,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,852 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:23:11,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,876 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:23:11,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:11,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,902 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:23:11,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-19 14:23:11,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,927 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:23:11,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 14:23:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,953 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:23:11,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:11,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:11,981 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:11,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:23:11,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:11,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:11,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:11,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:11,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:11,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:11,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:11,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:11,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:23:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,006 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:23:12,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,035 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-11-19 14:23:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,036 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:23:12,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:23:12,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,065 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:23:12,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:23:12,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,108 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-11-19 14:23:12,110 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-11-19 14:23:12,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:12,186 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-19 14:23:12,187 INFO L444 ModelExtractionUtils]: 17 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:23:12,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,189 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-11-19 14:23:12,190 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-11-19 14:23:12,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:12,204 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-19 14:23:12,205 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:12,205 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 2*insertionSort_~j~0 Supporting invariants [1*insertionSort_~array.offset >= 0] [2024-11-19 14:23:12,221 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-11-19 14:23:12,238 INFO L156 tatePredicateManager]: 3 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:23:12,245 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:23:12,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:23:12,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:12,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:12,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:12,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 14:23:12,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:12,557 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2024-11-19 14:23:12,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:12,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 106 transitions. Complement of second has 18 states. [2024-11-19 14:23:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2024-11-19 14:23:12,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 7 letters. [2024-11-19 14:23:12,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 24 letters. Loop has 7 letters. [2024-11-19 14:23:12,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 14 letters. [2024-11-19 14:23:12,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2024-11-19 14:23:12,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:12,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 72 states and 88 transitions. [2024-11-19 14:23:12,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-19 14:23:12,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-19 14:23:12,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2024-11-19 14:23:12,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:12,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-11-19 14:23:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2024-11-19 14:23:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-11-19 14:23:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 58 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-19 14:23:12,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-19 14:23:12,741 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-19 14:23:12,741 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:23:12,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2024-11-19 14:23:12,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-19 14:23:12,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:12,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:12,742 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:12,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:23:12,743 INFO L745 eck$LassoCheckResult]: Stem: 990#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 974#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 975#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 989#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 972#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 973#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 991#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1020#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1019#L33-4 havoc main_~i~0#1; 984#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1018#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 992#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 993#L15-6 #t~short3 := ~j~0 > 0; 1023#L15-1 assume !#t~short3; 986#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 983#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 968#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1017#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1016#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1014#L15-6 #t~short3 := ~j~0 > 0; 979#L15-1 [2024-11-19 14:23:12,743 INFO L747 eck$LassoCheckResult]: Loop: 979#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 980#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 967#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 969#L15-6 #t~short3 := ~j~0 > 0; 979#L15-1 [2024-11-19 14:23:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1302233657, now seen corresponding path program 1 times [2024-11-19 14:23:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631972963] [2024-11-19 14:23:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2024-11-19 14:23:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793309772] [2024-11-19 14:23:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2041310206, now seen corresponding path program 1 times [2024-11-19 14:23:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642782733] [2024-11-19 14:23:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:23:13,966 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:13,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:13,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:13,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:13,967 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:13,967 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:13,967 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:13,967 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:13,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration8_Lasso [2024-11-19 14:23:13,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:13,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:13,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:13,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:13,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:13,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:13,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:13,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,755 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:14,755 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,758 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-11-19 14:23:14,761 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-11-19 14:23:14,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:23:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,787 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-11-19 14:23:14,788 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-11-19 14:23:14,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:14,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,814 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:23:14,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,839 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:23:14,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:23:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,865 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:23:14,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:14,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:14,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,892 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:23:14,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,903 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:23:14,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,906 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:23:14,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-19 14:23:14,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,924 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:23:14,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:14,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:23:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,951 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:23:14,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:14,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-19 14:23:14,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,981 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:23:14,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:14,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:14,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:15,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-19 14:23:15,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,016 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:23:15,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:15,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:15,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:15,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:15,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:15,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:15,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:15,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:15,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:15,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,046 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:23:15,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:15,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:15,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:15,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:15,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:15,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:15,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:15,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:15,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:15,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,074 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:23:15,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:15,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:15,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:15,087 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:23:15,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:15,097 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-19 14:23:15,097 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-19 14:23:15,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:15,176 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-19 14:23:15,176 INFO L444 ModelExtractionUtils]: 18 out of 36 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-19 14:23:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,178 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:23:15,180 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:15,192 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-19 14:23:15,192 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:15,192 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2024-11-19 14:23:15,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:15,212 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:23:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:15,371 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:23:15,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,410 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 84 transitions. Complement of second has 8 states. [2024-11-19 14:23:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-19 14:23:15,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-19 14:23:15,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:15,412 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:15,582 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:23:15,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 84 transitions. Complement of second has 8 states. [2024-11-19 14:23:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-19 14:23:15,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-19 14:23:15,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:15,626 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:15,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:15,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:15,792 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:23:15,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,861 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 118 states and 153 transitions. Complement of second has 16 states. [2024-11-19 14:23:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-11-19 14:23:15,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-19 14:23:15,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:15,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 24 letters. Loop has 4 letters. [2024-11-19 14:23:15,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:15,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 8 letters. [2024-11-19 14:23:15,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:15,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 153 transitions. [2024-11-19 14:23:15,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-19 14:23:15,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 48 states and 58 transitions. [2024-11-19 14:23:15,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:23:15,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:23:15,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-11-19 14:23:15,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:15,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-19 14:23:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-11-19 14:23:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2024-11-19 14:23:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-19 14:23:15,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-19 14:23:15,869 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-19 14:23:15,869 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:23:15,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-11-19 14:23:15,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:23:15,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:15,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:15,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:15,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:15,871 INFO L745 eck$LassoCheckResult]: Stem: 1622#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1612#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 1621#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1623#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1624#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1609#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1610#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1631#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1630#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1599#L33-4 havoc main_~i~0#1; 1600#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1601#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1602#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1635#L15-6 #t~short3 := ~j~0 > 0; 1634#L15-1 assume !#t~short3; 1619#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1616#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1604#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1603#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1605#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1627#L15-6 #t~short3 := ~j~0 > 0; 1613#L15-1 assume !#t~short3; 1614#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1606#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1608#L15-6 #t~short3 := ~j~0 > 0; 1636#L15-1 [2024-11-19 14:23:15,871 INFO L747 eck$LassoCheckResult]: Loop: 1636#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1633#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1632#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1607#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1618#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1625#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1626#L15-6 #t~short3 := ~j~0 > 0; 1628#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1614#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1606#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1608#L15-6 #t~short3 := ~j~0 > 0; 1636#L15-1 [2024-11-19 14:23:15,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050558, now seen corresponding path program 1 times [2024-11-19 14:23:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:15,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558557487] [2024-11-19 14:23:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 14:23:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558557487] [2024-11-19 14:23:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558557487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:15,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139410824] [2024-11-19 14:23:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:15,907 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 1 times [2024-11-19 14:23:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328803267] [2024-11-19 14:23:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:15,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:15,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:16,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:23:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:23:16,693 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:16,698 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-19 14:23:16,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2024-11-19 14:23:16,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:23:16,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 47 transitions. [2024-11-19 14:23:16,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:23:16,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:23:16,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-11-19 14:23:16,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:16,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-19 14:23:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-11-19 14:23:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-19 14:23:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-19 14:23:16,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-19 14:23:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:23:16,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-19 14:23:16,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:23:16,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2024-11-19 14:23:16,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:23:16,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:16,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:16,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:16,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:16,706 INFO L745 eck$LassoCheckResult]: Stem: 1707#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1697#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 1706#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1694#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1695#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1708#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1718#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1717#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1716#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1690#L33-4 havoc main_~i~0#1; 1691#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1704#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1721#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1720#L15-6 #t~short3 := ~j~0 > 0; 1719#L15-1 assume !#t~short3; 1705#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1702#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1688#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1687#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1689#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1710#L15-6 #t~short3 := ~j~0 > 0; 1712#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1713#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1692#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1693#L15-6 #t~short3 := ~j~0 > 0; 1698#L15-1 [2024-11-19 14:23:16,706 INFO L747 eck$LassoCheckResult]: Loop: 1698#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1699#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1715#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1685#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1684#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1686#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1709#L15-6 #t~short3 := ~j~0 > 0; 1711#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1713#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1692#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1693#L15-6 #t~short3 := ~j~0 > 0; 1698#L15-1 [2024-11-19 14:23:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1757990976, now seen corresponding path program 2 times [2024-11-19 14:23:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430343097] [2024-11-19 14:23:16,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:16,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:16,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:16,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:16,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:16,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 2 times [2024-11-19 14:23:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281264630] [2024-11-19 14:23:16,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:16,752 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:16,752 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:16,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:16,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1753667593, now seen corresponding path program 3 times [2024-11-19 14:23:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075481554] [2024-11-19 14:23:16,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:16,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:23:16,797 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 14:23:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:16,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075481554] [2024-11-19 14:23:16,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075481554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994748431] [2024-11-19 14:23:16,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:16,942 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:16,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-19 14:23:17,024 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:23:17,025 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:17,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:23:17,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 14:23:17,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 14:23:17,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994748431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:17,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-11-19 14:23:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353681915] [2024-11-19 14:23:17,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:23:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:23:17,909 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 10 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:18,041 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-19 14:23:18,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-11-19 14:23:18,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:23:18,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 66 transitions. [2024-11-19 14:23:18,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-19 14:23:18,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:23:18,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2024-11-19 14:23:18,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:18,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-19 14:23:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2024-11-19 14:23:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-11-19 14:23:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-19 14:23:18,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-19 14:23:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 14:23:18,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-19 14:23:18,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:23:18,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-11-19 14:23:18,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:23:18,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:18,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:18,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:18,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:18,053 INFO L745 eck$LassoCheckResult]: Stem: 2056#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2046#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2047#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 2055#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2057#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2058#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2044#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2045#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2064#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2063#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 2031#L33-4 havoc main_~i~0#1; 2032#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2033#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2034#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2059#L15-6 #t~short3 := ~j~0 > 0; 2077#L15-1 assume !#t~short3; 2076#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 2075#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2036#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2035#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2037#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2060#L15-6 #t~short3 := ~j~0 > 0; 2069#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 2065#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 2038#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 2039#L15-6 #t~short3 := ~j~0 > 0; 2048#L15-1 assume !#t~short3; 2049#L15-3 [2024-11-19 14:23:18,053 INFO L747 eck$LassoCheckResult]: Loop: 2049#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 2052#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2042#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2054#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2074#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2072#L15-6 #t~short3 := ~j~0 > 0; 2073#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 2049#L15-3 [2024-11-19 14:23:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1336854580, now seen corresponding path program 4 times [2024-11-19 14:23:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675706910] [2024-11-19 14:23:18,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,068 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:18,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:18,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:18,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:18,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash -496333001, now seen corresponding path program 6 times [2024-11-19 14:23:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062660057] [2024-11-19 14:23:18,080 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,085 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:23:18,085 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:18,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:18,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 623643916, now seen corresponding path program 5 times [2024-11-19 14:23:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836889924] [2024-11-19 14:23:18,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,109 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 14:23:18,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:18,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:18,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:19,746 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:19,746 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:19,746 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:19,746 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:19,746 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:19,746 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:19,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:19,747 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:19,747 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration11_Lasso [2024-11-19 14:23:19,747 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:19,747 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:19,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:19,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:21,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:21,443 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,446 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-19 14:23:21,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-19 14:23:21,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,471 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-19 14:23:21,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-19 14:23:21,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,495 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-19 14:23:21,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-19 14:23:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,520 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-19 14:23:21,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-19 14:23:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,544 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-19 14:23:21,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-19 14:23:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,569 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:23:21,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,596 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:23:21,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-19 14:23:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,620 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:23:21,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,645 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-19 14:23:21,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-19 14:23:21,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,675 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-19 14:23:21,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-19 14:23:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,699 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-19 14:23:21,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-19 14:23:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,723 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-19 14:23:21,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-11-19 14:23:21,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,748 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-19 14:23:21,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-19 14:23:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,773 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-19 14:23:21,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:21,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:21,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-19 14:23:21,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,801 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-19 14:23:21,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,814 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:23:21,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,855 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-19 14:23:21,855 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-19 14:23:21,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,954 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-19 14:23:21,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:21,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:21,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,994 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-19 14:23:21,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:22,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:22,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:22,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:22,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:22,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:22,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:22,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:22,101 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-19 14:23:22,101 INFO L444 ModelExtractionUtils]: 14 out of 31 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-19 14:23:22,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:22,104 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:22,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-19 14:23:22,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:22,121 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:22,122 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:22,122 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2024-11-19 14:23:22,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:22,152 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-19 14:23:22,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:22,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:22,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:22,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:23:22,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:22,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:23:22,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 11 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:22,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 11. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 90 transitions. Complement of second has 16 states. [2024-11-19 14:23:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:23:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-19 14:23:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2024-11-19 14:23:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2024-11-19 14:23:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2024-11-19 14:23:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2024-11-19 14:23:22,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:23:22,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2024-11-19 14:23:22,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:23:22,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:23:22,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:23:22,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:22,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:23:22,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:23:22,344 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:23:22,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:23:22,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:23:22,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:23:22,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:23:22,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:23:22 BoogieIcfgContainer [2024-11-19 14:23:22,350 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:23:22,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:23:22,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:23:22,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:23:22,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:02" (3/4) ... [2024-11-19 14:23:22,353 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:23:22,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:23:22,354 INFO L158 Benchmark]: Toolchain (without parser) took 20940.92ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 107.4MB in the beginning and 232.5MB in the end (delta: -125.0MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,354 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 161.5MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:23:22,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.85ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 94.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.63ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,355 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 161.5MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,355 INFO L158 Benchmark]: RCFGBuilder took 297.47ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 78.9MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,356 INFO L158 Benchmark]: BuchiAutomizer took 20308.62ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 78.5MB in the beginning and 233.5MB in the end (delta: -155.0MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-19 14:23:22,356 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 318.8MB. Free memory was 233.5MB in the beginning and 232.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:23:22,358 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.69ms. Allocated memory is still 161.5MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.85ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 94.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.63ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 161.5MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.47ms. Allocated memory is still 161.5MB. Free memory was 91.1MB in the beginning and 78.9MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 20308.62ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 78.5MB in the beginning and 233.5MB in the end (delta: -155.0MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 318.8MB. Free memory was 233.5MB in the beginning and 232.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + n) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 14 locations. One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function (size + ((long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 17.6s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 38 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 170 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp101 ukn85 mio100 lsp47 div143 bol101 ite100 ukn100 eq163 hnf92 smp80 dnf151 smp83 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 119ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:23:22,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-19 14:23:22,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-11-19 14:23:22,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 14:23:22,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE