./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:15:55,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:15:55,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:15:55,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:15:55,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:15:55,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:15:55,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:15:55,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:15:55,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:15:55,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:15:55,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:15:55,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:15:55,990 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:15:55,990 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:15:55,991 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:15:55,991 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:15:55,991 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:15:55,992 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:15:55,992 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:15:55,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:15:55,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:15:55,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:15:55,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:15:55,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:15:55,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:15:55,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:15:55,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:15:55,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:15:55,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:15:55,998 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:15:55,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:15:55,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:15:55,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:15:55,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:15:56,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:15:56,004 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:15:56,004 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2024-10-15 00:15:56,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:15:56,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:15:56,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:15:56,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:15:56,280 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:15:56,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-15 00:15:56,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:15:58,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:15:58,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2024-10-15 00:15:58,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01984d71e/3b87fa545d3549d78e98159bcd820b0a/FLAG95579b763 [2024-10-15 00:15:58,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01984d71e/3b87fa545d3549d78e98159bcd820b0a [2024-10-15 00:15:58,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:15:58,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:15:58,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:15:58,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:15:58,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:15:58,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:58,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bac1962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58, skipping insertion in model container [2024-10-15 00:15:58,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:58,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:15:58,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:15:58,839 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:15:58,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:15:58,962 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:15:58,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58 WrapperNode [2024-10-15 00:15:58,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:15:58,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:15:58,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:15:58,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:15:58,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:58,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,000 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-10-15 00:15:59,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:15:59,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:15:59,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:15:59,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:15:59,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,029 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-15 00:15:59,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:15:59,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:15:59,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:15:59,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:15:59,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (1/1) ... [2024-10-15 00:15:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:15:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:15:59,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:15:59,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:15:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:15:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:15:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:15:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:15:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:15:59,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:15:59,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:15:59,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:15:59,394 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-15 00:15:59,395 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:15:59,409 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:15:59,409 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 00:15:59,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:15:59 BoogieIcfgContainer [2024-10-15 00:15:59,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:15:59,411 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:15:59,411 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:15:59,415 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:15:59,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:15:59,417 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:15:58" (1/3) ... [2024-10-15 00:15:59,418 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19997a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:15:59, skipping insertion in model container [2024-10-15 00:15:59,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:15:59,419 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:15:58" (2/3) ... [2024-10-15 00:15:59,420 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19997a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:15:59, skipping insertion in model container [2024-10-15 00:15:59,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:15:59,420 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:15:59" (3/3) ... [2024-10-15 00:15:59,422 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2024-10-15 00:15:59,490 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:15:59,490 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:15:59,490 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:15:59,491 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:15:59,491 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:15:59,491 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:15:59,491 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:15:59,492 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:15:59,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:15:59,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:15:59,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:15:59,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:15:59,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:15:59,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:15:59,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:15:59,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:15:59,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:15:59,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:15:59,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:15:59,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:15:59,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:15:59,527 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L558true assume !(main_~array_size~0#1 < 1); 6#L558-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 14#L562-3true [2024-10-15 00:15:59,527 INFO L747 eck$LassoCheckResult]: Loop: 14#L562-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 16#L562-2true main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 14#L562-3true [2024-10-15 00:15:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:15:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-15 00:15:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:15:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718987918] [2024-10-15 00:15:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:15:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:15:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:15:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:15:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:15:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-15 00:15:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:15:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496711952] [2024-10-15 00:15:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:15:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:15:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:15:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:15:59,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:15:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-15 00:15:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:15:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391044298] [2024-10-15 00:15:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:15:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:15:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:15:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:15:59,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:00,014 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:00,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:00,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:00,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:00,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:00,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:00,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:00,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2024-10-15 00:16:00,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:00,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:00,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:00,424 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:00,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:16:00,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:00,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:00,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:00,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:00,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:00,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:16:00,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:16:00,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-10-15 00:16:00,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:00,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:00,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:00,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:00,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:16:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:16:00,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:00,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:00,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:00,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:00,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:16:00,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:16:00,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:00,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:00,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:00,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:00,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:00,605 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-10-15 00:16:00,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:16:00,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:00,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:00,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:00,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:00,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:00,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:16:00,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:00,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:00,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:00,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:00,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:00,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:00,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:00,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:00,704 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:16:00,705 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:16:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:00,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:16:00,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:00,741 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:00,742 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:00,742 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-15 00:16:00,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:16:00,779 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-15 00:16:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:00,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:00,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:00,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:16:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:00,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:00,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:00,931 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:16:00,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:00,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 42 transitions. Complement of second has 6 states. [2024-10-15 00:16:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-10-15 00:16:00,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:16:00,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:00,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-15 00:16:00,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:00,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-15 00:16:00,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:00,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2024-10-15 00:16:00,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:16:01,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2024-10-15 00:16:01,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:16:01,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:16:01,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2024-10-15 00:16:01,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:01,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-15 00:16:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2024-10-15 00:16:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-15 00:16:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-10-15 00:16:01,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-15 00:16:01,030 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-10-15 00:16:01,031 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:16:01,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-10-15 00:16:01,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:16:01,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:01,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:01,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:01,033 INFO L745 eck$LassoCheckResult]: Stem: 106#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 102#L558 assume !(main_~array_size~0#1 < 1); 103#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 108#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 98#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 99#L550-3 [2024-10-15 00:16:01,033 INFO L747 eck$LassoCheckResult]: Loop: 99#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 101#L551-3 assume !true; 104#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 99#L550-3 [2024-10-15 00:16:01,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-15 00:16:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480626119] [2024-10-15 00:16:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480626119] [2024-10-15 00:16:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480626119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:16:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975815278] [2024-10-15 00:16:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,124 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2024-10-15 00:16:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530977916] [2024-10-15 00:16:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530977916] [2024-10-15 00:16:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530977916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:01,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:16:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563134651] [2024-10-15 00:16:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,134 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:16:01,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:16:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:16:01,138 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:01,141 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-10-15 00:16:01,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2024-10-15 00:16:01,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:16:01,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2024-10-15 00:16:01,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:16:01,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:16:01,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-10-15 00:16:01,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:01,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-15 00:16:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-10-15 00:16:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-15 00:16:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-15 00:16:01,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-15 00:16:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:16:01,146 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-15 00:16:01,146 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:16:01,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-15 00:16:01,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:16:01,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:01,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:01,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:01,147 INFO L745 eck$LassoCheckResult]: Stem: 137#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 135#L558 assume !(main_~array_size~0#1 < 1); 136#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 141#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 131#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 132#L550-3 [2024-10-15 00:16:01,147 INFO L747 eck$LassoCheckResult]: Loop: 132#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 134#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 139#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 132#L550-3 [2024-10-15 00:16:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-10-15 00:16:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140194581] [2024-10-15 00:16:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140194581] [2024-10-15 00:16:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140194581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:16:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232089779] [2024-10-15 00:16:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,196 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:01,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2024-10-15 00:16:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505786581] [2024-10-15 00:16:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505786581] [2024-10-15 00:16:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505786581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:16:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315741672] [2024-10-15 00:16:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,219 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:16:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:16:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:16:01,220 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:01,231 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-15 00:16:01,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-10-15 00:16:01,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-10-15 00:16:01,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:16:01,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:16:01,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-15 00:16:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:01,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:16:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-15 00:16:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:16:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-10-15 00:16:01,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:16:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:16:01,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:16:01,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:16:01,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-10-15 00:16:01,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:01,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:01,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,238 INFO L745 eck$LassoCheckResult]: Stem: 174#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 170#L558 assume !(main_~array_size~0#1 < 1); 171#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 176#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 166#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 167#L550-3 [2024-10-15 00:16:01,239 INFO L747 eck$LassoCheckResult]: Loop: 167#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 172#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 173#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 168#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 169#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 179#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 167#L550-3 [2024-10-15 00:16:01,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2024-10-15 00:16:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874344832] [2024-10-15 00:16:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874344832] [2024-10-15 00:16:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874344832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:16:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934347154] [2024-10-15 00:16:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,280 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2024-10-15 00:16:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337139943] [2024-10-15 00:16:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:16:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:16:01,410 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:01,427 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-15 00:16:01,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-15 00:16:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:16:01,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:16:01,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:16:01,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-15 00:16:01,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:01,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:16:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-15 00:16:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-15 00:16:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-10-15 00:16:01,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-15 00:16:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:16:01,431 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-15 00:16:01,431 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:16:01,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-10-15 00:16:01,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:01,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:01,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,433 INFO L745 eck$LassoCheckResult]: Stem: 210#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 206#L558 assume !(main_~array_size~0#1 < 1); 207#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 212#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 213#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 214#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 202#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 203#L550-3 [2024-10-15 00:16:01,433 INFO L747 eck$LassoCheckResult]: Loop: 203#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 208#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 209#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 204#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 205#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 215#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 203#L550-3 [2024-10-15 00:16:01,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-10-15 00:16:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577745549] [2024-10-15 00:16:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:01,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2024-10-15 00:16:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394769017] [2024-10-15 00:16:01,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:01,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2024-10-15 00:16:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636851371] [2024-10-15 00:16:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636851371] [2024-10-15 00:16:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636851371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213643544] [2024-10-15 00:16:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:01,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:01,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 00:16:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:01,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:16:01,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:01,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213643544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:01,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-15 00:16:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819490373] [2024-10-15 00:16:01,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 00:16:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 00:16:01,831 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:01,885 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-10-15 00:16:01,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2024-10-15 00:16:01,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2024-10-15 00:16:01,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-15 00:16:01,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:16:01,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-15 00:16:01,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:01,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 00:16:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-15 00:16:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-15 00:16:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-15 00:16:01,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:16:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:16:01,892 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:16:01,892 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:16:01,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-15 00:16:01,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:16:01,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:01,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:01,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:01,893 INFO L745 eck$LassoCheckResult]: Stem: 346#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 342#L558 assume !(main_~array_size~0#1 < 1); 343#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 348#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 349#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 350#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 351#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 353#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 338#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 339#L550-3 [2024-10-15 00:16:01,893 INFO L747 eck$LassoCheckResult]: Loop: 339#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 344#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 345#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 340#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 341#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 352#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 339#L550-3 [2024-10-15 00:16:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2024-10-15 00:16:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447332146] [2024-10-15 00:16:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:01,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2024-10-15 00:16:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344560208] [2024-10-15 00:16:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2024-10-15 00:16:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126774019] [2024-10-15 00:16:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:01,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:02,285 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:02,285 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:02,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:02,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:02,286 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:02,286 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,286 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:02,286 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:02,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2024-10-15 00:16:02,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:02,286 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:02,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:02,729 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:02,729 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:02,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:16:02,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:02,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:02,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:02,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:16:02,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:16:02,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:02,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:02,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:02,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:02,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:16:02,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:02,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:02,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:02,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:16:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,848 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:16:02,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:02,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:02,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:02,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,878 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:16:02,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:02,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:02,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,914 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-10-15 00:16:02,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,917 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:16:02,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:02,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:02,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:16:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:16:02,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:02,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:02,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:02,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 00:16:02,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:02,983 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:02,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:16:02,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:02,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:02,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:02,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:02,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:02,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:02,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:03,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:03,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:03,018 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:03,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:16:03,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:03,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:03,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:03,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:03,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:03,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:03,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:03,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:03,072 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-15 00:16:03,073 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:16:03,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:03,074 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:03,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:16:03,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:03,088 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:03,089 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:03,089 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 0)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 0)_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1 Supporting invariants [] [2024-10-15 00:16:03,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:03,116 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2024-10-15 00:16:03,120 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:16:03,121 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:16:03,121 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2024-10-15 00:16:03,121 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:16:03,121 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:16:03,121 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2024-10-15 00:16:03,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:03,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:16:03,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:03,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:16:03,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:03,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-10-15 00:16:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:03,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-15 00:16:03,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:03,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-15 00:16:03,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 46 transitions. Complement of second has 10 states. [2024-10-15 00:16:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-15 00:16:03,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-15 00:16:03,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:03,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 16 letters. Loop has 6 letters. [2024-10-15 00:16:03,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:03,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 10 letters. Loop has 12 letters. [2024-10-15 00:16:03,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:03,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2024-10-15 00:16:03,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-15 00:16:03,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2024-10-15 00:16:03,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-15 00:16:03,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-15 00:16:03,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-10-15 00:16:03,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:03,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-15 00:16:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-10-15 00:16:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-10-15 00:16:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-15 00:16:03,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-15 00:16:03,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-15 00:16:03,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:16:03,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2024-10-15 00:16:03,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-15 00:16:03,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:03,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:03,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:03,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:03,501 INFO L745 eck$LassoCheckResult]: Stem: 510#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 508#L558 assume !(main_~array_size~0#1 < 1); 509#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 516#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 520#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 521#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 522#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 528#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 502#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 503#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 518#L551-3 [2024-10-15 00:16:03,502 INFO L747 eck$LassoCheckResult]: Loop: 518#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 523#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 504#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 505#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 529#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 517#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 518#L551-3 [2024-10-15 00:16:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2024-10-15 00:16:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635550752] [2024-10-15 00:16:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:03,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:03,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2046083018, now seen corresponding path program 1 times [2024-10-15 00:16:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411054941] [2024-10-15 00:16:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:03,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:03,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2024-10-15 00:16:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004429647] [2024-10-15 00:16:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004429647] [2024-10-15 00:16:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004429647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439413421] [2024-10-15 00:16:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:03,639 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:03,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-15 00:16:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:03,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:16:03,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:03,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:16:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439413421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:03,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-15 00:16:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178131923] [2024-10-15 00:16:03,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 00:16:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-15 00:16:03,937 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 13 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:04,007 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-10-15 00:16:04,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2024-10-15 00:16:04,008 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-10-15 00:16:04,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 48 states and 61 transitions. [2024-10-15 00:16:04,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-15 00:16:04,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-15 00:16:04,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2024-10-15 00:16:04,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:04,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-10-15 00:16:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2024-10-15 00:16:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-10-15 00:16:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-10-15 00:16:04,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-15 00:16:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:16:04,019 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-15 00:16:04,019 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:16:04,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2024-10-15 00:16:04,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-15 00:16:04,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:04,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:04,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:04,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:16:04,021 INFO L745 eck$LassoCheckResult]: Stem: 712#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 710#L558 assume !(main_~array_size~0#1 < 1); 711#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 717#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 721#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 722#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 723#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 732#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 733#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 734#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 731#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 729#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 730#L551-3 [2024-10-15 00:16:04,021 INFO L747 eck$LassoCheckResult]: Loop: 730#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 740#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 738#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 735#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 726#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 727#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 730#L551-3 [2024-10-15 00:16:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -855173556, now seen corresponding path program 2 times [2024-10-15 00:16:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518403913] [2024-10-15 00:16:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:04,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2046083018, now seen corresponding path program 2 times [2024-10-15 00:16:04,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625646805] [2024-10-15 00:16:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2024-10-15 00:16:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911061204] [2024-10-15 00:16:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911061204] [2024-10-15 00:16:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911061204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466290573] [2024-10-15 00:16:04,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:16:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:04,213 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:04,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-15 00:16:04,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:16:04,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:04,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:16:04,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:16:04,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:16:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466290573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:04,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2024-10-15 00:16:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901526156] [2024-10-15 00:16:04,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 00:16:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-15 00:16:04,459 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 17 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:04,624 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2024-10-15 00:16:04,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 116 transitions. [2024-10-15 00:16:04,625 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2024-10-15 00:16:04,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 110 transitions. [2024-10-15 00:16:04,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-15 00:16:04,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-15 00:16:04,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 110 transitions. [2024-10-15 00:16:04,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:04,626 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 110 transitions. [2024-10-15 00:16:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 110 transitions. [2024-10-15 00:16:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2024-10-15 00:16:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-10-15 00:16:04,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-10-15 00:16:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 00:16:04,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-10-15 00:16:04,635 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:16:04,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2024-10-15 00:16:04,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-15 00:16:04,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:04,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:04,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:04,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2024-10-15 00:16:04,636 INFO L745 eck$LassoCheckResult]: Stem: 987#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 982#L558 assume !(main_~array_size~0#1 < 1); 983#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 992#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 993#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 994#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 995#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1002#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1004#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1003#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1005#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1011#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1012#L551-3 [2024-10-15 00:16:04,636 INFO L747 eck$LassoCheckResult]: Loop: 1012#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1015#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 978#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 979#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 984#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1010#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1009#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 999#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 1000#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1012#L551-3 [2024-10-15 00:16:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -855173556, now seen corresponding path program 3 times [2024-10-15 00:16:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823393912] [2024-10-15 00:16:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash 735525585, now seen corresponding path program 3 times [2024-10-15 00:16:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001295346] [2024-10-15 00:16:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2024-10-15 00:16:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:04,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053100831] [2024-10-15 00:16:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:04,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:05,140 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:05,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:05,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:05,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:05,140 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:05,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:05,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:05,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration9_Lasso [2024-10-15 00:16:05,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:05,140 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:05,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:05,478 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:05,478 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:16:05,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:05,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:05,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:05,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,508 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:16:05,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:05,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:05,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:05,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,536 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:16:05,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:05,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:05,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:05,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:05,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,563 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:16:05,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:05,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:05,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-15 00:16:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,598 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:16:05,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:05,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:05,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:05,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,625 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-10-15 00:16:05,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,627 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:16:05,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:05,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:05,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:05,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:16:05,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,665 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:16:05,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:05,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:05,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:05,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:05,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:05,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:05,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:05,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:05,733 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-15 00:16:05,733 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-15 00:16:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,735 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:16:05,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:05,749 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:16:05,749 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:05,749 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2) = -2*ULTIMATE.start_sort_~pass~0#1 + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 - 2*ULTIMATE.start_sort_~n#1 >= 0] [2024-10-15 00:16:05,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:05,770 INFO L156 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2024-10-15 00:16:05,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:16:05,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:16:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:05,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 00:16:05,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:05,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:16:05,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:06,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:16:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 00:16:06,103 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:16:06,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,337 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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 77 states and 99 transitions. Complement of second has 15 states. [2024-10-15 00:16:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:16:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2024-10-15 00:16:06,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 13 letters. Loop has 9 letters. [2024-10-15 00:16:06,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:06,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 22 letters. Loop has 9 letters. [2024-10-15 00:16:06,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:06,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 25 transitions. Stem has 13 letters. Loop has 18 letters. [2024-10-15 00:16:06,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:06,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 99 transitions. [2024-10-15 00:16:06,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:16:06,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 66 states and 86 transitions. [2024-10-15 00:16:06,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-15 00:16:06,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-15 00:16:06,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-10-15 00:16:06,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:06,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-10-15 00:16:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-10-15 00:16:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2024-10-15 00:16:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 51 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-10-15 00:16:06,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-10-15 00:16:06,355 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-10-15 00:16:06,355 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:16:06,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 69 transitions. [2024-10-15 00:16:06,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:06,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:06,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:06,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:06,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:06,356 INFO L745 eck$LassoCheckResult]: Stem: 1256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1250#L558 assume !(main_~array_size~0#1 < 1); 1251#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1262#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1263#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1264#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1265#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1291#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1290#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1258#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1259#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1287#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1246#L551-2 [2024-10-15 00:16:06,356 INFO L747 eck$LassoCheckResult]: Loop: 1246#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1247#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1252#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1246#L551-2 [2024-10-15 00:16:06,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash -856885551, now seen corresponding path program 1 times [2024-10-15 00:16:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885798127] [2024-10-15 00:16:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 75248, now seen corresponding path program 1 times [2024-10-15 00:16:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130352865] [2024-10-15 00:16:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1808203040, now seen corresponding path program 1 times [2024-10-15 00:16:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587019994] [2024-10-15 00:16:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587019994] [2024-10-15 00:16:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587019994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681516649] [2024-10-15 00:16:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:06,523 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:06,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-15 00:16:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:06,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:16:06,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:06,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681516649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:06,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:06,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-15 00:16:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368405148] [2024-10-15 00:16:06,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 00:16:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-15 00:16:06,799 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. cyclomatic complexity: 22 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:06,866 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-15 00:16:06,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2024-10-15 00:16:06,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:06,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 49 states and 64 transitions. [2024-10-15 00:16:06,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:16:06,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:16:06,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2024-10-15 00:16:06,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:06,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-10-15 00:16:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2024-10-15 00:16:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-15 00:16:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3125) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-10-15 00:16:06,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-15 00:16:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:16:06,872 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-15 00:16:06,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:16:06,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 63 transitions. [2024-10-15 00:16:06,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:06,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:06,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:06,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:06,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:06,873 INFO L745 eck$LassoCheckResult]: Stem: 1478#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1472#L558 assume !(main_~array_size~0#1 < 1); 1473#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1480#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1483#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1484#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1485#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1487#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1489#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1488#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1466#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1467#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1474#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1476#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1468#L551-2 [2024-10-15 00:16:06,873 INFO L747 eck$LassoCheckResult]: Loop: 1468#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1469#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1491#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1468#L551-2 [2024-10-15 00:16:06,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1483032527, now seen corresponding path program 1 times [2024-10-15 00:16:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347753076] [2024-10-15 00:16:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash 75248, now seen corresponding path program 2 times [2024-10-15 00:16:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114845053] [2024-10-15 00:16:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1306607552, now seen corresponding path program 1 times [2024-10-15 00:16:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806741381] [2024-10-15 00:16:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:07,396 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:07,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:07,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:07,397 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:07,397 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:07,397 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:07,397 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:07,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:07,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration11_Lasso [2024-10-15 00:16:07,397 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:07,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:07,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,998 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:07,998 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:07,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:07,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,002 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:16:08,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,039 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-10-15 00:16:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,043 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:16:08,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,082 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:08,102 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-15 00:16:08,102 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:16:08,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,106 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:16:08,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:08,123 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:08,123 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:08,123 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-10-15 00:16:08,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-15 00:16:08,151 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:16:08,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-10-15 00:16:08,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:16:08,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:16:08,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:08,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:08,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:08,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:08,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:08,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:16:08,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 63 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:08,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 63 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 140 transitions. Complement of second has 7 states. [2024-10-15 00:16:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-15 00:16:08,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-15 00:16:08,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:08,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2024-10-15 00:16:08,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:08,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:16:08,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:08,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 140 transitions. [2024-10-15 00:16:08,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:08,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 125 transitions. [2024-10-15 00:16:08,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-15 00:16:08,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-15 00:16:08,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 125 transitions. [2024-10-15 00:16:08,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:08,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-10-15 00:16:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 125 transitions. [2024-10-15 00:16:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-10-15 00:16:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.372093023255814) internal successors, (118), 85 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-15 00:16:08,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-15 00:16:08,265 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-15 00:16:08,265 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:16:08,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 118 transitions. [2024-10-15 00:16:08,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:08,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:08,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:08,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:08,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:08,267 INFO L745 eck$LassoCheckResult]: Stem: 1724#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1718#L558 assume !(main_~array_size~0#1 < 1); 1719#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1729#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1730#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1731#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1732#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1739#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 1738#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1737#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1712#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1713#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1726#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1740#L552 [2024-10-15 00:16:08,267 INFO L747 eck$LassoCheckResult]: Loop: 1740#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1714#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1715#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1740#L552 [2024-10-15 00:16:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash -740576421, now seen corresponding path program 1 times [2024-10-15 00:16:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641193970] [2024-10-15 00:16:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:08,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2024-10-15 00:16:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240501370] [2024-10-15 00:16:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:08,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 734883368, now seen corresponding path program 2 times [2024-10-15 00:16:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835031860] [2024-10-15 00:16:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:08,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:08,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-15 00:16:08,830 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:08,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:08,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:08,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:08,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:08,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,831 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:08,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:08,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration12_Lasso [2024-10-15 00:16:08,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:08,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:08,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:09,363 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:09,363 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,365 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-15 00:16:09,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:16:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,397 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-15 00:16:09,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-15 00:16:09,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,427 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:16:09,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-15 00:16:09,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,457 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-15 00:16:09,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:09,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,482 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:16:09,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,505 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-10-15 00:16:09,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,507 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:16:09,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,531 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-10-15 00:16:09,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,533 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:16:09,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-10-15 00:16:09,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:09,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,559 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-10-15 00:16:09,561 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-10-15 00:16:09,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:16:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,585 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:16:09,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-10-15 00:16:09,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-15 00:16:09,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,615 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:16:09,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:16:09,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,649 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:16:09,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:16:09,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,696 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:16:09,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-15 00:16:09,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,726 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:16:09,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,754 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-10-15 00:16:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,756 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:16:09,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,804 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:16:09,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:16:09,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,835 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:16:09,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:09,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,865 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:16:09,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:09,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:09,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:09,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:09,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:09,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-15 00:16:09,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,901 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:16:09,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-10-15 00:16:09,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:09,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:09,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:09,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:09,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:09,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:09,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:09,952 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:16:09,952 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-15 00:16:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,954 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-10-15 00:16:09,955 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-10-15 00:16:09,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:09,967 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:09,967 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:09,967 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_4, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_4 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-10-15 00:16:09,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-15 00:16:09,995 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:16:09,996 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-10-15 00:16:09,996 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:16:09,997 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:16:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:10,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:10,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:10,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:10,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:10,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:16:10,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 118 transitions. cyclomatic complexity: 42 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 118 transitions. cyclomatic complexity: 42. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 135 states and 199 transitions. Complement of second has 7 states. [2024-10-15 00:16:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-15 00:16:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-15 00:16:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-15 00:16:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-15 00:16:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:10,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 199 transitions. [2024-10-15 00:16:10,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:10,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 108 states and 152 transitions. [2024-10-15 00:16:10,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-15 00:16:10,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:16:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 152 transitions. [2024-10-15 00:16:10,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:10,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 152 transitions. [2024-10-15 00:16:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 152 transitions. [2024-10-15 00:16:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2024-10-15 00:16:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 86 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-10-15 00:16:10,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-10-15 00:16:10,103 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-10-15 00:16:10,103 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:16:10,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2024-10-15 00:16:10,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:10,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:10,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:10,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:10,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:10,104 INFO L745 eck$LassoCheckResult]: Stem: 2031#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2029#L558 assume !(main_~array_size~0#1 < 1); 2030#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2036#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2040#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2041#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2042#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2050#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2049#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2048#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2023#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2024#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2033#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2034#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 2101#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2102#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2099#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2080#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2066#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2064#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 2058#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2055#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2052#L552 [2024-10-15 00:16:10,104 INFO L747 eck$LassoCheckResult]: Loop: 2052#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2044#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2056#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2052#L552 [2024-10-15 00:16:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 38429379, now seen corresponding path program 1 times [2024-10-15 00:16:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933572802] [2024-10-15 00:16:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:10,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:10,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2024-10-15 00:16:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502507845] [2024-10-15 00:16:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:10,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:10,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1906596416, now seen corresponding path program 2 times [2024-10-15 00:16:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115481467] [2024-10-15 00:16:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:10,278 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-10-15 00:16:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 00:16:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115481467] [2024-10-15 00:16:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115481467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354346828] [2024-10-15 00:16:10,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:16:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:10,371 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:10,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-10-15 00:16:10,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:16:10,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:10,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:16:10,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 00:16:10,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 00:16:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354346828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:10,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 17 [2024-10-15 00:16:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862861317] [2024-10-15 00:16:10,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 00:16:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-15 00:16:10,710 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. cyclomatic complexity: 45 Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:10,784 INFO L93 Difference]: Finished difference Result 155 states and 207 transitions. [2024-10-15 00:16:10,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 207 transitions. [2024-10-15 00:16:10,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:10,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 90 states and 124 transitions. [2024-10-15 00:16:10,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-15 00:16:10,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:16:10,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 124 transitions. [2024-10-15 00:16:10,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:10,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 124 transitions. [2024-10-15 00:16:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 124 transitions. [2024-10-15 00:16:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-15 00:16:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 88 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-15 00:16:10,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-15 00:16:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:16:10,796 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-15 00:16:10,796 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:16:10,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 123 transitions. [2024-10-15 00:16:10,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:10,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:10,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:10,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:10,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:10,800 INFO L745 eck$LassoCheckResult]: Stem: 2452#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2446#L558 assume !(main_~array_size~0#1 < 1); 2447#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2457#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2458#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2459#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2460#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2508#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2507#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2506#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2467#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2466#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2440#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2441#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2448#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2449#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 2516#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2527#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2514#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2496#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2479#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2477#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 2475#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2470#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2469#L552 [2024-10-15 00:16:10,800 INFO L747 eck$LassoCheckResult]: Loop: 2469#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2462#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2472#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2469#L552 [2024-10-15 00:16:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1064601249, now seen corresponding path program 3 times [2024-10-15 00:16:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980061175] [2024-10-15 00:16:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:10,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980061175] [2024-10-15 00:16:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980061175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067631359] [2024-10-15 00:16:10,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:16:10,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:10,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:10,961 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:10,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-15 00:16:11,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-15 00:16:11,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:11,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:16:11,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:11,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067631359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:11,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2024-10-15 00:16:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536123975] [2024-10-15 00:16:11,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:11,232 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 5 times [2024-10-15 00:16:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518874477] [2024-10-15 00:16:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 00:16:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-10-15 00:16:11,332 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. cyclomatic complexity: 45 Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:11,491 INFO L93 Difference]: Finished difference Result 132 states and 179 transitions. [2024-10-15 00:16:11,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 179 transitions. [2024-10-15 00:16:11,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:11,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 124 states and 170 transitions. [2024-10-15 00:16:11,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-15 00:16:11,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:16:11,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 170 transitions. [2024-10-15 00:16:11,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:11,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 170 transitions. [2024-10-15 00:16:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 170 transitions. [2024-10-15 00:16:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-10-15 00:16:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 94 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-10-15 00:16:11,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-15 00:16:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:16:11,505 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-15 00:16:11,506 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-15 00:16:11,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 128 transitions. [2024-10-15 00:16:11,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:11,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:11,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:11,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:11,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:11,508 INFO L745 eck$LassoCheckResult]: Stem: 2847#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2848#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2842#L558 assume !(main_~array_size~0#1 < 1); 2843#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2849#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2853#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2854#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2855#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2865#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2864#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2863#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 2862#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2861#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2836#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2837#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2850#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2911#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2909#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2908#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2907#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2893#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2902#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2892#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2894#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2883#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2880#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 2878#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2873#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2872#L552 [2024-10-15 00:16:11,508 INFO L747 eck$LassoCheckResult]: Loop: 2872#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2838#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 2839#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2872#L552 [2024-10-15 00:16:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1496021002, now seen corresponding path program 3 times [2024-10-15 00:16:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318839350] [2024-10-15 00:16:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 6 times [2024-10-15 00:16:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737446758] [2024-10-15 00:16:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash 914001837, now seen corresponding path program 4 times [2024-10-15 00:16:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039182609] [2024-10-15 00:16:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:14,154 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:14,154 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:14,154 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:14,154 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:14,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:14,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:14,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:14,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:14,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration15_Lasso [2024-10-15 00:16:14,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:14,155 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:14,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:14,963 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:14,963 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:14,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:14,965 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-10-15 00:16:14,966 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-10-15 00:16:14,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:14,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:14,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:14,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:14,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:14,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:14,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:14,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:14,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:14,991 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-10-15 00:16:14,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:14,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:14,994 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-10-15 00:16:14,995 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-10-15 00:16:14,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:15,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:15,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:15,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,021 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-10-15 00:16:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,023 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-10-15 00:16:15,024 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-10-15 00:16:15,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:15,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:15,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:15,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:16:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,056 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-10-15 00:16:15,057 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-10-15 00:16:15,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:15,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:15,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:15,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,089 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-10-15 00:16:15,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,091 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-10-15 00:16:15,092 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-10-15 00:16:15,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:15,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:15,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,118 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-10-15 00:16:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,120 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-10-15 00:16:15,121 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-10-15 00:16:15,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:15,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:15,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-15 00:16:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,163 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-10-15 00:16:15,167 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-10-15 00:16:15,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:15,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:15,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,217 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-10-15 00:16:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,219 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-10-15 00:16:15,220 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-10-15 00:16:15,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:15,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:15,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:15,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-15 00:16:15,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,250 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-10-15 00:16:15,251 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-10-15 00:16:15,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:15,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:15,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:15,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:15,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:15,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:15,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:15,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:15,313 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-15 00:16:15,314 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-15 00:16:15,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:15,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:15,316 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-15 00:16:15,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:15,329 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:16:15,329 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:15,329 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~i~0#1 - 2*ULTIMATE.start_sort_~pass~0#1 + 5 Supporting invariants [-1*ULTIMATE.start_sort_~n#1 + 4 >= 0] [2024-10-15 00:16:15,343 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-10-15 00:16:15,355 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-10-15 00:16:15,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:15,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:16:15,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:15,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:16:15,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:15,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:16:15,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:15,696 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 242 transitions. Complement of second has 15 states. [2024-10-15 00:16:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:16:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2024-10-15 00:16:15,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 28 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-15 00:16:15,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:15,697 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:16:15,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:15,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:16:15,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:15,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:16:15,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:15,935 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:16:15,935 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:16,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 242 transitions. Complement of second has 15 states. [2024-10-15 00:16:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:16:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2024-10-15 00:16:16,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 28 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-15 00:16:16,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:16,027 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:16:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:16,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:16:16,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:16,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:16:16,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:16,251 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:16:16,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:16,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 128 transitions. cyclomatic complexity: 44. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 249 states and 359 transitions. Complement of second has 14 states. [2024-10-15 00:16:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:16:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2024-10-15 00:16:16,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-15 00:16:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 31 letters. Loop has 3 letters. [2024-10-15 00:16:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:16,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 40 transitions. Stem has 28 letters. Loop has 6 letters. [2024-10-15 00:16:16,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:16,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 359 transitions. [2024-10-15 00:16:16,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:16,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 98 states and 131 transitions. [2024-10-15 00:16:16,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-15 00:16:16,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:16:16,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2024-10-15 00:16:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:16,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 131 transitions. [2024-10-15 00:16:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2024-10-15 00:16:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-15 00:16:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 96 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2024-10-15 00:16:16,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-10-15 00:16:16,357 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-10-15 00:16:16,357 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-15 00:16:16,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 130 transitions. [2024-10-15 00:16:16,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:16,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:16,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:16,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:16,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:16,358 INFO L745 eck$LassoCheckResult]: Stem: 3947#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3942#L558 assume !(main_~array_size~0#1 < 1); 3943#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 3949#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3953#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3954#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3955#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3975#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3973#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3971#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3969#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3964#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 3961#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3960#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3936#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 3937#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3944#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3945#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 4016#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4013#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4007#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3993#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4030#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4031#L552 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 3986#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 3974#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3972#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 3970#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3968#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3963#L552 [2024-10-15 00:16:16,358 INFO L747 eck$LassoCheckResult]: Loop: 3963#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3957#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 3967#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3963#L552 [2024-10-15 00:16:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1529420500, now seen corresponding path program 4 times [2024-10-15 00:16:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42333481] [2024-10-15 00:16:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:16,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42333481] [2024-10-15 00:16:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42333481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095472728] [2024-10-15 00:16:16,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:16:16,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:16,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:16,566 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:16,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-10-15 00:16:16,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:16:16,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:16,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 00:16:16,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:16,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095472728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:16,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-15 00:16:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129843850] [2024-10-15 00:16:16,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:16,889 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 7 times [2024-10-15 00:16:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:16,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084888761] [2024-10-15 00:16:16,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:16,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:16,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 00:16:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-10-15 00:16:16,980 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. cyclomatic complexity: 44 Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:17,132 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2024-10-15 00:16:17,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 198 transitions. [2024-10-15 00:16:17,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:17,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 138 states and 187 transitions. [2024-10-15 00:16:17,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-15 00:16:17,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:16:17,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 187 transitions. [2024-10-15 00:16:17,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:17,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 187 transitions. [2024-10-15 00:16:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 187 transitions. [2024-10-15 00:16:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2024-10-15 00:16:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 108 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2024-10-15 00:16:17,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 145 transitions. [2024-10-15 00:16:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 00:16:17,144 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2024-10-15 00:16:17,144 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-15 00:16:17,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 145 transitions. [2024-10-15 00:16:17,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:17,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:17,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:17,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:17,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:17,146 INFO L745 eck$LassoCheckResult]: Stem: 4402#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 4396#L558 assume !(main_~array_size~0#1 < 1); 4397#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 4404#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4408#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4409#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4410#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4420#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4419#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4418#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4417#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4416#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 4415#L562-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4414#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4390#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 4391#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4405#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4464#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4461#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4462#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4475#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4493#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4492#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4491#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4479#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4482#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4477#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4478#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4439#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4413#L550-2 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 4406#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4407#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4432#L552 [2024-10-15 00:16:17,150 INFO L747 eck$LassoCheckResult]: Loop: 4432#L552 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4392#L551-2 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 4393#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4432#L552 [2024-10-15 00:16:17,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -182306019, now seen corresponding path program 5 times [2024-10-15 00:16:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152696949] [2024-10-15 00:16:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 8 times [2024-10-15 00:16:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603461339] [2024-10-15 00:16:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:17,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2055059238, now seen corresponding path program 6 times [2024-10-15 00:16:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:17,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354745766] [2024-10-15 00:16:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:17,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:22,537 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 265 DAG size of output: 201 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:16:22,904 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:22,904 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:22,904 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:22,904 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:22,904 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:22,904 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:22,904 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:22,904 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:22,904 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration17_Lasso [2024-10-15 00:16:22,905 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:22,905 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:22,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:22,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:23,389 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:23,389 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,391 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-15 00:16:23,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-15 00:16:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,418 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-15 00:16:23,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:23,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,447 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-15 00:16:23,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-10-15 00:16:23,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:23,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,476 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-15 00:16:23,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-15 00:16:23,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,501 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-15 00:16:23,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-15 00:16:23,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,529 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-15 00:16:23,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,555 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-15 00:16:23,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-15 00:16:23,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,587 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-15 00:16:23,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-15 00:16:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,631 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-15 00:16:23,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-15 00:16:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,660 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-15 00:16:23,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-15 00:16:23,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,688 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-15 00:16:23,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-15 00:16:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,715 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-15 00:16:23,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:23,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:23,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:23,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-15 00:16:23,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,742 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-15 00:16:23,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-10-15 00:16:23,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,774 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-15 00:16:23,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-15 00:16:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,803 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-15 00:16:23,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-15 00:16:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,852 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-15 00:16:23,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:23,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:23,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,923 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-15 00:16:23,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-10-15 00:16:23,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:23,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-15 00:16:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,952 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-15 00:16:23,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-10-15 00:16:23,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:23,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:23,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:23,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:23,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:23,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:23,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:23,987 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:16:23,987 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-15 00:16:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:23,989 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:23,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-15 00:16:23,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:24,001 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:24,002 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:24,002 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_6, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_6 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-10-15 00:16:24,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:24,021 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:16:24,023 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-10-15 00:16:24,023 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:16:24,023 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:16:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:24,109 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:16:24,109 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 231 transitions. Complement of second has 7 states. [2024-10-15 00:16:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-15 00:16:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 33 letters. Loop has 3 letters. [2024-10-15 00:16:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:24,125 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:16:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:24,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:16:24,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 162 states and 231 transitions. Complement of second has 7 states. [2024-10-15 00:16:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-15 00:16:24,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 33 letters. Loop has 3 letters. [2024-10-15 00:16:24,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:24,228 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:16:24,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:24,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:16:24,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:24,315 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:16:24,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 145 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 190 states and 276 transitions. Complement of second has 6 states. [2024-10-15 00:16:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-15 00:16:24,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 33 letters. Loop has 3 letters. [2024-10-15 00:16:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:24,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 36 letters. Loop has 3 letters. [2024-10-15 00:16:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:24,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 33 letters. Loop has 6 letters. [2024-10-15 00:16:24,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:24,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 276 transitions. [2024-10-15 00:16:24,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:16:24,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 0 states and 0 transitions. [2024-10-15 00:16:24,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:16:24,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:16:24,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:16:24,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:16:24,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:16:24,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:16:24,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:16:24,345 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-15 00:16:24,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:16:24,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:16:24,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:16:24,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:16:24 BoogieIcfgContainer [2024-10-15 00:16:24,351 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:16:24,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:16:24,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:16:24,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:16:24,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:15:59" (3/4) ... [2024-10-15 00:16:24,354 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:16:24,355 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:16:24,355 INFO L158 Benchmark]: Toolchain (without parser) took 25805.73ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 104.8MB in the beginning and 230.5MB in the end (delta: -125.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,355 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 182.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:16:24,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.48ms. Allocated memory is still 182.5MB. Free memory was 104.8MB in the beginning and 149.6MB in the end (delta: -44.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 148.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,356 INFO L158 Benchmark]: Boogie Preprocessor took 39.01ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,356 INFO L158 Benchmark]: RCFGBuilder took 368.71ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 133.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,356 INFO L158 Benchmark]: BuchiAutomizer took 24940.12ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 133.7MB in the beginning and 230.5MB in the end (delta: -96.8MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-10-15 00:16:24,356 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 356.5MB. Free memory is still 230.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:16:24,357 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.71ms. Allocated memory is still 182.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.48ms. Allocated memory is still 182.5MB. Free memory was 104.8MB in the beginning and 149.6MB in the end (delta: -44.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 148.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.01ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.71ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 133.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 24940.12ms. Allocated memory was 182.5MB in the beginning and 356.5MB in the end (delta: 174.1MB). Free memory was 133.7MB in the beginning and 230.5MB in the end (delta: -96.8MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 356.5MB. Free memory is still 230.5MB. 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: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (10 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (array_size + ((long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 12 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function ((5 + ((long) -2 * i)) + ((long) -2 * pass)) and consists of 12 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.8s and 18 iterations. TraceHistogramMax:5. Analysis of lassos took 21.1s. Construction of modules took 0.6s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 150 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1203 IncrementalHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 198 mSDtfsCounter, 1203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU3 SILI2 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax109 hnf100 lsp89 ukn60 mio100 lsp48 div137 bol100 ite100 ukn100 eq164 hnf91 smp82 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:16:24,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-15 00:16:24,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-10-15 00:16:24,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-10-15 00:16:24,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2024-10-15 00:16:25,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:25,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-15 00:16:25,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:25,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 00:16:25,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE