./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:43:23,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:43:23,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:43:23,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:43:23,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:43:23,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:43:23,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:43:23,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:43:23,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:43:23,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:43:23,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:43:23,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:43:23,539 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:43:23,539 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:43:23,541 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:43:23,541 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:43:23,541 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:43:23,541 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:43:23,541 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:43:23,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:43:23,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:43:23,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:43:23,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:43:23,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:43:23,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:43:23,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:43:23,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:43:23,544 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:43:23,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:43:23,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:43:23,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:43:23,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:43:23,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:43:23,546 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:43:23,546 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2024-10-12 00:43:23,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:43:23,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:43:23,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:43:23,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:43:23,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:43:23,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-10-12 00:43:24,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:43:25,132 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:43:25,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-10-12 00:43:25,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca2c12010/5f32e90072ec4623bf358a268c42f239/FLAG0a2b23471 [2024-10-12 00:43:25,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca2c12010/5f32e90072ec4623bf358a268c42f239 [2024-10-12 00:43:25,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:43:25,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:43:25,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:43:25,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:43:25,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:43:25,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a22419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25, skipping insertion in model container [2024-10-12 00:43:25,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:43:25,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:43:25,338 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:43:25,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:43:25,375 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:43:25,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25 WrapperNode [2024-10-12 00:43:25,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:43:25,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:43:25,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:43:25,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:43:25,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,403 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-10-12 00:43:25,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:43:25,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:43:25,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:43:25,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:43:25,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,427 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-10-12 00:43:25,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:43:25,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:43:25,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:43:25,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:43:25,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (1/1) ... [2024-10-12 00:43:25,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:25,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:25,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:43:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:43:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:43:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:43:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:43:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:43:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:43:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:43:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:43:25,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:43:25,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:43:25,698 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-12 00:43:25,698 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:43:25,706 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:43:25,707 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 00:43:25,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:25 BoogieIcfgContainer [2024-10-12 00:43:25,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:43:25,708 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:43:25,708 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:43:25,710 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:43:25,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:25,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:43:25" (1/3) ... [2024-10-12 00:43:25,712 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d107f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:43:25, skipping insertion in model container [2024-10-12 00:43:25,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:25,712 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:25" (2/3) ... [2024-10-12 00:43:25,712 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d107f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:43:25, skipping insertion in model container [2024-10-12 00:43:25,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:25,712 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:25" (3/3) ... [2024-10-12 00:43:25,713 INFO L332 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2024-10-12 00:43:25,753 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:43:25,753 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:43:25,753 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:43:25,753 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:43:25,753 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:43:25,753 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:43:25,753 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:43:25,753 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:43:25,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12 00:43:25,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-12 00:43:25,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:25,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:25,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:43:25,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:43:25,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:43:25,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12 00:43:25,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-12 00:43:25,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:25,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:25,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:43:25,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:43:25,785 INFO L745 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 6#L44-3true [2024-10-12 00:43:25,786 INFO L747 eck$LassoCheckResult]: Loop: 6#L44-3true assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 19#L44-2true main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 6#L44-3true [2024-10-12 00:43:25,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:43:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595609754] [2024-10-12 00:43:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:25,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:25,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:43:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036879118] [2024-10-12 00:43:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:25,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:25,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:43:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662854406] [2024-10-12 00:43:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:25,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:26,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:26,456 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:43:26,457 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:43:26,457 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:43:26,457 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:43:26,457 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:43:26,457 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:26,457 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:43:26,457 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:43:26,457 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2024-10-12 00:43:26,457 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:43:26,458 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:43:26,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:26,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:43:26,914 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:43:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:26,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:43:26,919 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-12 00:43:26,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:26,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:26,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:26,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:26,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:26,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:26,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:26,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:26,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:43:26,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:26,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:26,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:43:26,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:26,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:26,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:26,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:26,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:26,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:26,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:26,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:26,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:43:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:26,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:26,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:43:26,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:26,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:26,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:26,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:26,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:43:27,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:43:27,027 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-12 00:43:27,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:43:27,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,066 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:43:27,068 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-12 00:43:27,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:43:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:43:27,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:27,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:43:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:43:27,136 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-12 00:43:27,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:43:27,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:43:27,181 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-12 00:43:27,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:43:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:43:27,217 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-12 00:43:27,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:43:27,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,246 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:43:27,248 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-12 00:43:27,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:27,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:27,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:27,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,274 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:43:27,276 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-12 00:43:27,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:27,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:43:27,312 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-12 00:43:27,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:43:27,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:43:27,345 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-12 00:43:27,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:43:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:43:27,383 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-12 00:43:27,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:27,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:43:27,417 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-12 00:43:27,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:43:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,448 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:43:27,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:27,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:27,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:43:27,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,478 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:43:27,479 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-12 00:43:27,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:27,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:27,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:27,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:27,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:27,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:27,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:43:27,530 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-12 00:43:27,530 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:43:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:27,557 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:27,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:43:27,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:43:27,571 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:43:27,571 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:43:27,572 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1) = 8*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~#array~1#1.base)_1 Supporting invariants [] [2024-10-12 00:43:27,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:43:27,596 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-12 00:43:27,602 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:43:27,603 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:43:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:27,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:43:27,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:27,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:43:27,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:27,679 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-12 00:43:27,702 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-12 00:43:27,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 00:43:27,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 65 transitions. Complement of second has 6 states. [2024-10-12 00:43:27,747 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-12 00:43:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 00:43:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-10-12 00:43:27,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:43:27,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:43:27,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:27,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:43:27,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:27,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2024-10-12 00:43:27,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:43:27,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 20 states and 29 transitions. [2024-10-12 00:43:27,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:43:27,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-12 00:43:27,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2024-10-12 00:43:27,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:27,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-12 00:43:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2024-10-12 00:43:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 00:43:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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-12 00:43:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-10-12 00:43:27,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-12 00:43:27,785 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-12 00:43:27,785 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:43:27,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-10-12 00:43:27,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:43:27,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:27,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:27,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:43:27,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:27,788 INFO L745 eck$LassoCheckResult]: Stem: 142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 129#L44-3 assume !(main_~i~1#1 >= 0); 130#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 128#L30-3 [2024-10-12 00:43:27,788 INFO L747 eck$LassoCheckResult]: Loop: 128#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 140#L32-3 assume !true; 141#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 127#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 128#L30-3 [2024-10-12 00:43:27,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-12 00:43:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63394049] [2024-10-12 00:43:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:27,835 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-12 00:43:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63394049] [2024-10-12 00:43:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63394049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:27,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:43:27,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338323945] [2024-10-12 00:43:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:27,839 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:27,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1679284, now seen corresponding path program 1 times [2024-10-12 00:43:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:27,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282488368] [2024-10-12 00:43:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:27,848 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-12 00:43:27,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282488368] [2024-10-12 00:43:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282488368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:27,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:43:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509575248] [2024-10-12 00:43:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:27,850 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:43:27,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:43:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:43:27,853 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12 00:43:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:27,857 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2024-10-12 00:43:27,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2024-10-12 00:43:27,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:27,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2024-10-12 00:43:27,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:43:27,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:43:27,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-10-12 00:43:27,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:27,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:43:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-10-12 00:43:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 00:43:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:43:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-12 00:43:27,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:43:27,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:43:27,863 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:43:27,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:43:27,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-10-12 00:43:27,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:27,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:27,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:27,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:43:27,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:27,866 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 170#L44-3 assume !(main_~i~1#1 >= 0); 171#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 169#L30-3 [2024-10-12 00:43:27,866 INFO L747 eck$LassoCheckResult]: Loop: 169#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 182#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 183#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 168#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 169#L30-3 [2024-10-12 00:43:27,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2024-10-12 00:43:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347382441] [2024-10-12 00:43:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:27,899 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-12 00:43:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347382441] [2024-10-12 00:43:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347382441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:27,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:43:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005021148] [2024-10-12 00:43:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:27,900 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2024-10-12 00:43:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638611874] [2024-10-12 00:43:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:27,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:27,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:43:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:43:27,985 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 00:43:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:27,996 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-10-12 00:43:27,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-10-12 00:43:27,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:27,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2024-10-12 00:43:27,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:43:27,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:43:27,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-12 00:43:27,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:27,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-12 00:43:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-12 00:43:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-12 00:43:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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-12 00:43:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:43:27,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:43:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:43:28,002 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:43:28,002 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:43:28,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-12 00:43:28,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:28,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:28,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:43:28,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:28,003 INFO L745 eck$LassoCheckResult]: Stem: 225#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 211#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 212#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 213#L44-3 assume !(main_~i~1#1 >= 0); 214#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 210#L30-3 [2024-10-12 00:43:28,003 INFO L747 eck$LassoCheckResult]: Loop: 210#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 223#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 224#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 209#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 210#L30-3 [2024-10-12 00:43:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-12 00:43:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077271468] [2024-10-12 00:43:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:28,058 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-12 00:43:28,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:28,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077271468] [2024-10-12 00:43:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077271468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:28,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823003416] [2024-10-12 00:43:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:28,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:28,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-12 00:43:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:28,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:43:28,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:28,106 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-12 00:43:28,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:28,119 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-12 00:43:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823003416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:28,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 00:43:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140756228] [2024-10-12 00:43:28,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:28,120 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:28,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2024-10-12 00:43:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056447661] [2024-10-12 00:43:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:43:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:43:28,201 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-12 00:43:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:28,232 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-12 00:43:28,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2024-10-12 00:43:28,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 00:43:28,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:43:28,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:43:28,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-10-12 00:43:28,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:28,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:43:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-10-12 00:43:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-12 00:43:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:43:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-12 00:43:28,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-12 00:43:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:43:28,236 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-12 00:43:28,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:43:28,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-10-12 00:43:28,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:28,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:28,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-12 00:43:28,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:28,237 INFO L745 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 294#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 295#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 296#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 297#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 314#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 313#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 312#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 311#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 310#L44-3 assume !(main_~i~1#1 >= 0); 298#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 293#L30-3 [2024-10-12 00:43:28,237 INFO L747 eck$LassoCheckResult]: Loop: 293#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 307#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 308#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 292#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 293#L30-3 [2024-10-12 00:43:28,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-12 00:43:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623729960] [2024-10-12 00:43:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623729960] [2024-10-12 00:43:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623729960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272613277] [2024-10-12 00:43:28,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:43:28,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:28,326 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:28,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-12 00:43:28,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:43:28,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:28,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:43:28,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:28,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272613277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:28,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:28,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-12 00:43:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394835982] [2024-10-12 00:43:28,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:28,424 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:28,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2024-10-12 00:43:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639196768] [2024-10-12 00:43:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:43:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:43:28,521 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:43:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:28,559 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-12 00:43:28,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2024-10-12 00:43:28,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2024-10-12 00:43:28,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:43:28,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:43:28,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2024-10-12 00:43:28,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:28,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-12 00:43:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2024-10-12 00:43:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2024-10-12 00:43:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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-12 00:43:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-12 00:43:28,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 00:43:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:43:28,564 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 00:43:28,564 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:43:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-10-12 00:43:28,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:28,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:28,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2024-10-12 00:43:28,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:28,565 INFO L745 eck$LassoCheckResult]: Stem: 449#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 434#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 435#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 436#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 437#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 456#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 455#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 454#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 453#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 452#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 451#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 450#L44-3 assume !(main_~i~1#1 >= 0); 438#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 433#L30-3 [2024-10-12 00:43:28,566 INFO L747 eck$LassoCheckResult]: Loop: 433#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 447#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 448#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 432#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 433#L30-3 [2024-10-12 00:43:28,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2024-10-12 00:43:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081316791] [2024-10-12 00:43:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2024-10-12 00:43:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543991536] [2024-10-12 00:43:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2024-10-12 00:43:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241239071] [2024-10-12 00:43:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241239071] [2024-10-12 00:43:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241239071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:43:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868994708] [2024-10-12 00:43:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:43:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:43:28,755 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-12 00:43:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:28,790 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-12 00:43:28,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-12 00:43:28,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:43:28,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-10-12 00:43:28,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:43:28,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:43:28,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-10-12 00:43:28,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:28,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-12 00:43:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-10-12 00:43:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-10-12 00:43:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 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-12 00:43:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 00:43:28,793 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:43:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:43:28,793 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:43:28,793 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:43:28,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2024-10-12 00:43:28,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:28,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:28,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:28,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:28,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:28,794 INFO L745 eck$LassoCheckResult]: Stem: 521#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 518#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 505#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 506#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 507#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 508#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 529#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 528#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 527#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 526#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 525#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 524#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 523#L44-3 assume !(main_~i~1#1 >= 0); 509#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 510#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 520#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 515#L33 [2024-10-12 00:43:28,794 INFO L747 eck$LassoCheckResult]: Loop: 515#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 516#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 519#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 515#L33 [2024-10-12 00:43:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2024-10-12 00:43:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958487526] [2024-10-12 00:43:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2024-10-12 00:43:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971581237] [2024-10-12 00:43:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:28,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2024-10-12 00:43:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619590164] [2024-10-12 00:43:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 00:43:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:29,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619590164] [2024-10-12 00:43:29,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619590164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:29,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442069620] [2024-10-12 00:43:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:29,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:29,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:29,140 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:29,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-12 00:43:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:29,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:43:29,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:29,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:43:29,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-10-12 00:43:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:29,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:43:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442069620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:29,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:43:29,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-12 00:43:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992614203] [2024-10-12 00:43:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:43:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:43:29,394 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12 00:43:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:29,438 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-12 00:43:29,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-10-12 00:43:29,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:43:29,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-10-12 00:43:29,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:43:29,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:43:29,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-10-12 00:43:29,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:29,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 00:43:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-10-12 00:43:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-10-12 00:43:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 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-12 00:43:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-12 00:43:29,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 00:43:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:43:29,441 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 00:43:29,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:43:29,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-10-12 00:43:29,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:29,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:29,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:29,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:29,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:29,442 INFO L745 eck$LassoCheckResult]: Stem: 655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 639#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 640#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 641#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 642#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 656#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 663#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 662#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 661#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 660#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 659#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 658#L44-3 assume !(main_~i~1#1 >= 0); 643#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 644#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 654#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 649#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 650#L32-2 [2024-10-12 00:43:29,442 INFO L747 eck$LassoCheckResult]: Loop: 650#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 653#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 664#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 650#L32-2 [2024-10-12 00:43:29,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2024-10-12 00:43:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730406119] [2024-10-12 00:43:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:29,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:29,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:29,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2024-10-12 00:43:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517130657] [2024-10-12 00:43:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:29,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:29,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:29,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2024-10-12 00:43:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684779993] [2024-10-12 00:43:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684779993] [2024-10-12 00:43:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684779993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496353782] [2024-10-12 00:43:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:29,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:29,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:29,658 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:29,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-12 00:43:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:29,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:43:29,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:29,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:43:29,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 32 [2024-10-12 00:43:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:29,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496353782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:30,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-10-12 00:43:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015567992] [2024-10-12 00:43:30,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 00:43:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-10-12 00:43:30,280 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 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-12 00:43:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:30,527 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-12 00:43:30,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2024-10-12 00:43:30,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-12 00:43:30,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2024-10-12 00:43:30,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:43:30,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:43:30,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2024-10-12 00:43:30,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:30,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-12 00:43:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2024-10-12 00:43:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-10-12 00:43:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-12 00:43:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-12 00:43:30,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-12 00:43:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:43:30,533 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-12 00:43:30,533 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:43:30,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2024-10-12 00:43:30,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:30,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:30,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:30,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:30,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:30,534 INFO L745 eck$LassoCheckResult]: Stem: 880#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 863#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 864#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 865#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 866#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 881#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 888#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 887#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 886#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 885#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 884#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 883#L44-3 assume !(main_~i~1#1 >= 0); 867#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 868#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 878#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 879#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 891#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 890#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 882#L32-4 [2024-10-12 00:43:30,534 INFO L747 eck$LassoCheckResult]: Loop: 882#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 861#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 862#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 877#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 882#L32-4 [2024-10-12 00:43:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1574718017, now seen corresponding path program 1 times [2024-10-12 00:43:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198140680] [2024-10-12 00:43:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:30,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198140680] [2024-10-12 00:43:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198140680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692765334] [2024-10-12 00:43:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:30,592 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:30,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-12 00:43:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:30,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:43:30,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:30,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692765334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:30,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-10-12 00:43:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550230057] [2024-10-12 00:43:30,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:30,760 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 5 times [2024-10-12 00:43:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417598133] [2024-10-12 00:43:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:30,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:30,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:43:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:43:30,836 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-12 00:43:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:30,971 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-12 00:43:30,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2024-10-12 00:43:30,972 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-12 00:43:30,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2024-10-12 00:43:30,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-10-12 00:43:30,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-12 00:43:30,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2024-10-12 00:43:30,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:30,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-10-12 00:43:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2024-10-12 00:43:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-12 00:43:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 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-12 00:43:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-12 00:43:30,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-12 00:43:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:43:30,979 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-12 00:43:30,979 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:43:30,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-12 00:43:30,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:43:30,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:30,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:30,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2024-10-12 00:43:30,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:30,982 INFO L745 eck$LassoCheckResult]: Stem: 1101#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 1098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 1085#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1086#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1087#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1088#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1113#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1112#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1111#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1110#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1109#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1106#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1105#L44-3 assume !(main_~i~1#1 >= 0); 1089#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 1090#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1127#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1126#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1125#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1124#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1123#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1122#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1121#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1120#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1119#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1118#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1116#L33 [2024-10-12 00:43:30,982 INFO L747 eck$LassoCheckResult]: Loop: 1116#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 1117#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1115#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1116#L33 [2024-10-12 00:43:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash 649240641, now seen corresponding path program 1 times [2024-10-12 00:43:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795113010] [2024-10-12 00:43:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:30,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:31,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 3 times [2024-10-12 00:43:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722787954] [2024-10-12 00:43:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1290237019, now seen corresponding path program 2 times [2024-10-12 00:43:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723387522] [2024-10-12 00:43:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-12 00:43:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723387522] [2024-10-12 00:43:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723387522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:43:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136653630] [2024-10-12 00:43:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:43:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:43:31,187 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 12 Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-12 00:43:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:31,254 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-10-12 00:43:31,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2024-10-12 00:43:31,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:31,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 53 transitions. [2024-10-12 00:43:31,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-12 00:43:31,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-12 00:43:31,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2024-10-12 00:43:31,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:31,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-12 00:43:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2024-10-12 00:43:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-12 00:43:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 45 states have internal predecessors, (53), 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-12 00:43:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-12 00:43:31,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-12 00:43:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:43:31,257 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-12 00:43:31,257 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:43:31,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2024-10-12 00:43:31,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:31,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:31,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:31,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:31,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:31,259 INFO L745 eck$LassoCheckResult]: Stem: 1217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 1214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 1201#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1202#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1203#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1204#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1231#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1230#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1228#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1226#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1224#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1220#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1219#L44-3 assume !(main_~i~1#1 >= 0); 1205#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 1206#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1216#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1211#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1212#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1215#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1244#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1243#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1242#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1241#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1240#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1239#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1238#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1237#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1236#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 1218#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1199#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 1200#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1235#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1234#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1233#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1232#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1227#L33 [2024-10-12 00:43:31,259 INFO L747 eck$LassoCheckResult]: Loop: 1227#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 1229#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1222#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1227#L33 [2024-10-12 00:43:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -264183975, now seen corresponding path program 1 times [2024-10-12 00:43:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174116634] [2024-10-12 00:43:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:31,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 4 times [2024-10-12 00:43:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206145695] [2024-10-12 00:43:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:31,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1924678077, now seen corresponding path program 1 times [2024-10-12 00:43:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004539867] [2024-10-12 00:43:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004539867] [2024-10-12 00:43:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004539867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298351125] [2024-10-12 00:43:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:31,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:31,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:31,741 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:31,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:43:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:31,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:43:31,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:32,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:43:32,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 24 [2024-10-12 00:43:32,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:43:32,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-10-12 00:43:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 00:43:32,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 00:43:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298351125] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:32,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2024-10-12 00:43:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972647361] [2024-10-12 00:43:32,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 00:43:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 00:43:32,834 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. cyclomatic complexity: 10 Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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-12 00:43:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:33,925 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-10-12 00:43:33,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 79 transitions. [2024-10-12 00:43:33,925 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-10-12 00:43:33,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 79 transitions. [2024-10-12 00:43:33,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-10-12 00:43:33,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-12 00:43:33,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 79 transitions. [2024-10-12 00:43:33,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:33,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-10-12 00:43:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 79 transitions. [2024-10-12 00:43:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2024-10-12 00:43:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 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-12 00:43:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-12 00:43:33,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-12 00:43:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 00:43:33,933 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-12 00:43:33,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:43:33,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2024-10-12 00:43:33,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:33,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:33,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:33,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:33,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:33,937 INFO L745 eck$LassoCheckResult]: Stem: 1645#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 1642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 1629#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1630#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1631#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1632#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1658#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1657#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1656#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1655#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1653#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 1649#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1648#L44-3 assume !(main_~i~1#1 >= 0); 1633#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 1634#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1671#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1670#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1669#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1668#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1667#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1666#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1665#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1664#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1663#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1662#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1661#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1660#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1659#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 1646#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1627#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 1628#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 1647#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1673#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1643#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1644#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1639#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 1640#L32-2 [2024-10-12 00:43:33,937 INFO L747 eck$LassoCheckResult]: Loop: 1640#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 1651#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 1672#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 1640#L32-2 [2024-10-12 00:43:33,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:33,937 INFO L85 PathProgramCache]: Analyzing trace with hash 400231404, now seen corresponding path program 2 times [2024-10-12 00:43:33,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:33,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598783230] [2024-10-12 00:43:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:33,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:33,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:33,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 5 times [2024-10-12 00:43:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594548648] [2024-10-12 00:43:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:33,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:33,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:33,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash 464581374, now seen corresponding path program 2 times [2024-10-12 00:43:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:33,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671300797] [2024-10-12 00:43:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671300797] [2024-10-12 00:43:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671300797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225310302] [2024-10-12 00:43:34,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:43:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:34,403 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:43:34,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:43:34,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:34,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 00:43:34,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:34,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:43:34,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-12 00:43:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 00:43:34,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225310302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:35,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 29 [2024-10-12 00:43:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116728384] [2024-10-12 00:43:35,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 00:43:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-10-12 00:43:35,144 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. cyclomatic complexity: 8 Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 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-12 00:43:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:35,808 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-10-12 00:43:35,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2024-10-12 00:43:35,809 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-12 00:43:35,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 79 transitions. [2024-10-12 00:43:35,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-12 00:43:35,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-12 00:43:35,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2024-10-12 00:43:35,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:35,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-12 00:43:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2024-10-12 00:43:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2024-10-12 00:43:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.1) internal successors, (55), 49 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-12 00:43:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-10-12 00:43:35,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-12 00:43:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 00:43:35,813 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-12 00:43:35,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:43:35,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2024-10-12 00:43:35,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:35,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:35,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:35,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:35,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:35,814 INFO L745 eck$LassoCheckResult]: Stem: 2068#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 2064#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 2051#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2052#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2053#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2054#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2077#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2076#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2075#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2074#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2073#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2072#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2071#L44-3 assume !(main_~i~1#1 >= 0); 2055#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 2056#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2094#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2093#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2092#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2091#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2090#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2089#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2088#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2087#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2086#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2085#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2084#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2083#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2082#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2069#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2049#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2050#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2070#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2096#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2065#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2066#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2067#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2098#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2097#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2081#L32-4 [2024-10-12 00:43:35,814 INFO L747 eck$LassoCheckResult]: Loop: 2081#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2080#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2078#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2079#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2081#L32-4 [2024-10-12 00:43:35,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676157, now seen corresponding path program 3 times [2024-10-12 00:43:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004571821] [2024-10-12 00:43:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004571821] [2024-10-12 00:43:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004571821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061688617] [2024-10-12 00:43:35,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:43:35,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:35,886 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:35,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:43:35,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 00:43:35,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:35,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:43:35,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:36,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061688617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:36,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-12 00:43:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683697249] [2024-10-12 00:43:36,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:36,115 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:36,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 6 times [2024-10-12 00:43:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353382204] [2024-10-12 00:43:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:43:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:43:36,184 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. cyclomatic complexity: 8 Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-12 00:43:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:36,267 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-12 00:43:36,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 62 transitions. [2024-10-12 00:43:36,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:43:36,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 62 transitions. [2024-10-12 00:43:36,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-12 00:43:36,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-12 00:43:36,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2024-10-12 00:43:36,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:36,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-12 00:43:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2024-10-12 00:43:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-12 00:43:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 49 states have internal predecessors, (54), 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-12 00:43:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-12 00:43:36,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-12 00:43:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:43:36,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-12 00:43:36,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:43:36,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2024-10-12 00:43:36,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-12 00:43:36,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:36,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:36,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:36,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:36,271 INFO L745 eck$LassoCheckResult]: Stem: 2431#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 2427#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 2414#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2415#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2416#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2417#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2443#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2442#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2441#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2440#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2439#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2436#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2435#L44-3 assume !(main_~i~1#1 >= 0); 2418#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 2419#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2457#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2456#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2455#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2454#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2453#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2452#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2451#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2450#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2449#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2448#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2447#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2446#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2445#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2444#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2412#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2413#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2434#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2461#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2428#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2429#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2459#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2460#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2430#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2424#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2425#L32-2 [2024-10-12 00:43:36,272 INFO L747 eck$LassoCheckResult]: Loop: 2425#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2438#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2458#L33 assume SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1;havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1;SelectionSort_~rh~0#1 := SelectionSort_~i~0#1; 2425#L32-2 [2024-10-12 00:43:36,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash 464581376, now seen corresponding path program 4 times [2024-10-12 00:43:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:36,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569155554] [2024-10-12 00:43:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:36,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 6 times [2024-10-12 00:43:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:36,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011472320] [2024-10-12 00:43:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:36,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:36,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1959183210, now seen corresponding path program 3 times [2024-10-12 00:43:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067111544] [2024-10-12 00:43:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-12 00:43:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067111544] [2024-10-12 00:43:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067111544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623653234] [2024-10-12 00:43:36,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:43:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:36,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:36,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-12 00:43:36,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-12 00:43:36,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:36,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-12 00:43:36,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:43:36,536 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 00:43:36,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-10-12 00:43:36,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 00:43:36,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 00:43:37,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2024-10-12 00:43:37,246 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-10-12 00:43:37,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 22 [2024-10-12 00:43:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:37,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623653234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:37,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-10-12 00:43:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792254274] [2024-10-12 00:43:37,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 00:43:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-10-12 00:43:37,759 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 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-12 00:43:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:40,567 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-10-12 00:43:40,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 100 transitions. [2024-10-12 00:43:40,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-12 00:43:40,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 100 transitions. [2024-10-12 00:43:40,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-10-12 00:43:40,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-10-12 00:43:40,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 100 transitions. [2024-10-12 00:43:40,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:40,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-10-12 00:43:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 100 transitions. [2024-10-12 00:43:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2024-10-12 00:43:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 55 states have internal predecessors, (61), 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-12 00:43:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-12 00:43:40,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-12 00:43:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-12 00:43:40,573 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-12 00:43:40,573 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 00:43:40,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2024-10-12 00:43:40,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-12 00:43:40,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:40,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:40,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:40,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1] [2024-10-12 00:43:40,574 INFO L745 eck$LassoCheckResult]: Stem: 2926#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 2922#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 2909#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2910#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2911#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2912#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2937#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2936#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2935#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2934#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2933#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 2931#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2930#L44-3 assume !(main_~i~1#1 >= 0); 2913#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 2914#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2952#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2951#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2950#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2949#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2948#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2947#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2946#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2945#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2944#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2943#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2942#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2941#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2940#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2939#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2938#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2928#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2929#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2958#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2954#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2955#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2956#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2957#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2924#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2925#L33 [2024-10-12 00:43:40,574 INFO L747 eck$LassoCheckResult]: Loop: 2925#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2959#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2953#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2927#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2907#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2908#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 2932#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2919#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2920#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2923#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2962#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2961#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2960#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 2925#L33 [2024-10-12 00:43:40,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 5 times [2024-10-12 00:43:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287599312] [2024-10-12 00:43:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:40,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:40,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:40,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1388052987, now seen corresponding path program 1 times [2024-10-12 00:43:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928688499] [2024-10-12 00:43:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:40,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:40,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -984435007, now seen corresponding path program 6 times [2024-10-12 00:43:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331802213] [2024-10-12 00:43:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 103 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:40,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331802213] [2024-10-12 00:43:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331802213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:40,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093071663] [2024-10-12 00:43:40,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:43:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:40,703 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:40,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-12 00:43:40,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-12 00:43:40,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:40,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:43:40,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:40,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093071663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:41,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-12 00:43:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405166314] [2024-10-12 00:43:41,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:41,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:43:41,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:43:41,247 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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-12 00:43:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:41,323 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-10-12 00:43:41,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-10-12 00:43:41,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:43:41,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-10-12 00:43:41,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2024-10-12 00:43:41,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-10-12 00:43:41,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-10-12 00:43:41,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:43:41,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-12 00:43:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-10-12 00:43:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-10-12 00:43:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 52 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-12 00:43:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-12 00:43:41,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-12 00:43:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:43:41,330 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-12 00:43:41,331 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-12 00:43:41,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2024-10-12 00:43:41,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-12 00:43:41,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:41,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:41,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:41,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:43:41,332 INFO L745 eck$LassoCheckResult]: Stem: 3367#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 3363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 3350#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3351#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3352#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3353#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3379#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3378#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3377#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3376#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3375#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3372#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3371#L44-3 assume !(main_~i~1#1 >= 0); 3354#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 3355#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 3393#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3392#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3391#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3390#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3389#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3388#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3387#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3386#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3385#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3384#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3383#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3382#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3381#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3380#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3348#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3349#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 3370#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3399#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3395#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3396#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3397#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3398#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3366#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3360#L33 [2024-10-12 00:43:41,335 INFO L747 eck$LassoCheckResult]: Loop: 3360#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3361#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3394#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3368#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3369#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3373#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 3374#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3400#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3364#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3365#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3360#L33 [2024-10-12 00:43:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 7 times [2024-10-12 00:43:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437962016] [2024-10-12 00:43:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:41,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash -685142247, now seen corresponding path program 2 times [2024-10-12 00:43:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154420142] [2024-10-12 00:43:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:41,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1269305379, now seen corresponding path program 8 times [2024-10-12 00:43:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14107284] [2024-10-12 00:43:41,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:41,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:45,016 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:43:45,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:43:45,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:43:45,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:43:45,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:43:45,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:45,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:43:45,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:43:45,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration16_Lasso [2024-10-12 00:43:45,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:43:45,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:43:45,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:45,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:46,052 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:43:46,052 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:43:46,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,054 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:43:46,056 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-12 00:43:46,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,079 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:43:46,080 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-12 00:43:46,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:43:46,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,103 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:43:46,105 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-12 00:43:46,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:43:46,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,127 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:43:46,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:46,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,151 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:43:46,156 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-12 00:43:46,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,180 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:43:46,196 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-12 00:43:46,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:43:46,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,220 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:43:46,222 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-12 00:43:46,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,245 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:43:46,247 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-12 00:43:46,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,269 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:43:46,270 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-12 00:43:46,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:43:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,292 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:43:46,296 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-12 00:43:46,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:46,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:46,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:46,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,320 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:43:46,322 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-12 00:43:46,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,346 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:43:46,347 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-12 00:43:46,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:43:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,372 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:43:46,373 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-12 00:43:46,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,397 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:43:46,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-12 00:43:46,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:43:46,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,424 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:43:46,426 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-12 00:43:46,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:43:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,451 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:43:46,453 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-12 00:43:46,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,477 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:43:46,479 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-12 00:43:46,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:43:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,503 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:43:46,505 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-12 00:43:46,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,530 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:43:46,531 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-12 00:43:46,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,555 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:43:46,556 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-12 00:43:46,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:43:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,580 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:43:46,581 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-12 00:43:46,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,606 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:43:46,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-12 00:43:46,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:43:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,632 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:43:46,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-12 00:43:46,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:43:46,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,658 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:43:46,659 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-12 00:43:46,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 00:43:46,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,684 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:43:46,685 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-12 00:43:46,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:46,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 00:43:46,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,731 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:43:46,733 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-12 00:43:46,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:46,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:46,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:46,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:46,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:46,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:46,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:43:46,790 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-12 00:43:46,790 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-10-12 00:43:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:46,793 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:46,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:43:46,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:43:46,806 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:43:46,806 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:43:46,806 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~lh~0#1, ~n~0) = -1*ULTIMATE.start_SelectionSort_~lh~0#1 + 1*~n~0 Supporting invariants [] [2024-10-12 00:43:46,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:43:46,860 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2024-10-12 00:43:46,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:46,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:43:46,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:46,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:43:46,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:46,976 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-12 00:43:46,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 57 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-12 00:43:46,998 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 57 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 83 states and 90 transitions. Complement of second has 7 states. [2024-10-12 00:43:46,999 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-12 00:43:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-12 00:43:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-12 00:43:46,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 10 letters. [2024-10-12 00:43:47,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:47,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 48 letters. Loop has 10 letters. [2024-10-12 00:43:47,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:47,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 20 letters. [2024-10-12 00:43:47,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:47,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 90 transitions. [2024-10-12 00:43:47,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 69 states and 76 transitions. [2024-10-12 00:43:47,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:43:47,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:43:47,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 76 transitions. [2024-10-12 00:43:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:47,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-10-12 00:43:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 76 transitions. [2024-10-12 00:43:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-12 00:43:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 67 states have internal predecessors, (75), 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-12 00:43:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-10-12 00:43:47,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-12 00:43:47,005 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-12 00:43:47,005 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-12 00:43:47,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 75 transitions. [2024-10-12 00:43:47,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:47,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:47,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:47,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:47,007 INFO L745 eck$LassoCheckResult]: Stem: 3745#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 3740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 3725#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3726#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3727#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3728#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3757#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3756#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3755#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3754#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3753#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3752#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3751#L44-3 assume !(main_~i~1#1 >= 0); 3729#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 3730#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 3749#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3775#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3774#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3773#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3772#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3771#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3770#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3769#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3768#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3767#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3766#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3765#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3764#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3747#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3748#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3750#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 3744#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3735#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3736#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3741#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3743#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3788#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3787#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3780#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3781#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3760#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3746#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 3721#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3722#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 3739#L26 havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0; 3734#L49-3 [2024-10-12 00:43:47,007 INFO L747 eck$LassoCheckResult]: Loop: 3734#L49-3 assume !!(main_~i~1#1 < 5);call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3731#L15 assume !(0 == __VERIFIER_assert_~cond#1); 3732#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3733#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3734#L49-3 [2024-10-12 00:43:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1714859028, now seen corresponding path program 1 times [2024-10-12 00:43:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718259407] [2024-10-12 00:43:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718259407] [2024-10-12 00:43:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718259407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108417304] [2024-10-12 00:43:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:47,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:47,069 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:47,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-10-12 00:43:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:47,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:43:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:47,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:43:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108417304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:47,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:47,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-12 00:43:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383537399] [2024-10-12 00:43:47,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:47,290 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 1 times [2024-10-12 00:43:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654874546] [2024-10-12 00:43:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:43:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:43:47,328 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. cyclomatic complexity: 10 Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 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-12 00:43:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:47,378 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-10-12 00:43:47,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 132 transitions. [2024-10-12 00:43:47,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 88 states and 98 transitions. [2024-10-12 00:43:47,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:43:47,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:43:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2024-10-12 00:43:47,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:47,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-12 00:43:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2024-10-12 00:43:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-10-12 00:43:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 78 states have internal predecessors, (88), 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-12 00:43:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-12 00:43:47,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-12 00:43:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:43:47,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-12 00:43:47,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-12 00:43:47,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 88 transitions. [2024-10-12 00:43:47,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:47,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:47,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:47,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:47,387 INFO L745 eck$LassoCheckResult]: Stem: 4217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 4209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 4194#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4195#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4196#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4197#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4218#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4232#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4231#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4230#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4228#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4223#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4222#L44-3 assume !(main_~i~1#1 >= 0); 4198#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 4199#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4214#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4204#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4205#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4251#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4263#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4262#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4261#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4260#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4259#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4258#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4257#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4256#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4255#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4254#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4253#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4252#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4215#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4216#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4250#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4249#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4248#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4247#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4246#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4245#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4244#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4237#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4220#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4192#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4193#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4221#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4242#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4241#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4239#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4240#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4227#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4233#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4229#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4225#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4219#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4190#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4191#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4208#L26 havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0; 4203#L49-3 [2024-10-12 00:43:47,388 INFO L747 eck$LassoCheckResult]: Loop: 4203#L49-3 assume !!(main_~i~1#1 < 5);call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4200#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4201#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4202#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4203#L49-3 [2024-10-12 00:43:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 666849612, now seen corresponding path program 2 times [2024-10-12 00:43:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357465212] [2024-10-12 00:43:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 00:43:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357465212] [2024-10-12 00:43:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357465212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:43:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226241456] [2024-10-12 00:43:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:47,448 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:47,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 2 times [2024-10-12 00:43:47,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442654050] [2024-10-12 00:43:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:43:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:43:47,488 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-12 00:43:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:47,506 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-10-12 00:43:47,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 95 transitions. [2024-10-12 00:43:47,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 82 states and 88 transitions. [2024-10-12 00:43:47,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:43:47,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:43:47,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 88 transitions. [2024-10-12 00:43:47,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:47,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-12 00:43:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 88 transitions. [2024-10-12 00:43:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-12 00:43:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 78 states have internal predecessors, (85), 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-12 00:43:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-10-12 00:43:47,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-12 00:43:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:43:47,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-12 00:43:47,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-12 00:43:47,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 85 transitions. [2024-10-12 00:43:47,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:47,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:47,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:47,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:47,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:47,512 INFO L745 eck$LassoCheckResult]: Stem: 4390#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 4384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 4369#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4370#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4371#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4372#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4408#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4406#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4404#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4402#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4400#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4395#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4394#L44-3 assume !(main_~i~1#1 >= 0); 4373#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 4374#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4388#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4379#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4380#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4387#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4443#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4442#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4440#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4438#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4436#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4434#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4432#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4431#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4421#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4422#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4430#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4393#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4389#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4381#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4382#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4441#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4439#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4437#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4435#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4433#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4425#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4426#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4392#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4367#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4368#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4427#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4423#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4424#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4428#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4418#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4417#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4416#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4415#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4399#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4411#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4412#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4405#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4403#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4401#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4397#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4391#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4365#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4366#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4383#L26 havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0; 4378#L49-3 [2024-10-12 00:43:47,512 INFO L747 eck$LassoCheckResult]: Loop: 4378#L49-3 assume !!(main_~i~1#1 < 5);call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4375#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4376#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4377#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4378#L49-3 [2024-10-12 00:43:47,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2101796860, now seen corresponding path program 3 times [2024-10-12 00:43:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941128589] [2024-10-12 00:43:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 70 proven. 82 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 00:43:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941128589] [2024-10-12 00:43:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941128589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80765593] [2024-10-12 00:43:47,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:43:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:47,600 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:47,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-10-12 00:43:47,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-12 00:43:47,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:43:47,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:43:47,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:47,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 00:43:47,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 00:43:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80765593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:47,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:43:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243086398] [2024-10-12 00:43:47,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:47,850 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:47,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 3 times [2024-10-12 00:43:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235081675] [2024-10-12 00:43:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:47,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:43:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:43:47,887 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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-12 00:43:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:48,074 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-10-12 00:43:48,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 112 transitions. [2024-10-12 00:43:48,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:48,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 95 states and 102 transitions. [2024-10-12 00:43:48,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-12 00:43:48,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-12 00:43:48,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-10-12 00:43:48,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:48,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-10-12 00:43:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-10-12 00:43:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2024-10-12 00:43:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.072289156626506) internal successors, (89), 82 states have internal predecessors, (89), 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-12 00:43:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-10-12 00:43:48,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-12 00:43:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 00:43:48,081 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-12 00:43:48,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-12 00:43:48,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 89 transitions. [2024-10-12 00:43:48,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:48,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:48,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:48,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:43:48,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:43:48,083 INFO L745 eck$LassoCheckResult]: Stem: 5003#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(20, 3);~#array~0.base, ~#array~0.offset := 3, 0;call write~init~int#1(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int#1(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 4995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post7#1, main_#t~mem8#1, main_#t~post9#1, main_~#array~1#1.base, main_~#array~1#1.offset, main_~i~1#1;call main_~#array~1#1.base, main_~#array~1#1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1#1;main_~i~1#1 := 4; 4980#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4981#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4982#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 4983#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 5004#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 5014#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 5013#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 5012#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 5011#L44-3 assume !!(main_~i~1#1 >= 0);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 5010#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 5009#L44-3 assume !(main_~i~1#1 >= 0); 4984#L44-4 assume { :begin_inline_SelectionSort } true;havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;havoc SelectionSort_~lh~0#1;havoc SelectionSort_~rh~0#1;havoc SelectionSort_~i~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~lh~0#1 := 0; 4985#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4999#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5000#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5058#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5057#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4992#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4993#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4998#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5052#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5056#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5055#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5054#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5053#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5001#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5002#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4978#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4979#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 5008#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5049#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5048#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5047#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5046#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5045#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5044#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5043#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5042#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5041#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5040#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5039#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5038#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 5037#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5036#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5035#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5034#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5032#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5033#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5028#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5029#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5024#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5025#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 5021#L32-3 assume !!(SelectionSort_~i~0#1 < ~n~0);call SelectionSort_#t~mem1#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0#1, 4);call SelectionSort_#t~mem2#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5020#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5019#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5017#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5016#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 5015#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5006#L30-3 assume !!(SelectionSort_~lh~0#1 < ~n~0);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 5007#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5005#L32-4 call SelectionSort_#t~mem4#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);SelectionSort_~temp~0#1 := SelectionSort_#t~mem4#1;havoc SelectionSort_#t~mem4#1;call SelectionSort_#t~mem5#1 := read~int#1(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4);call write~int#1(SelectionSort_#t~mem5#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0#1, 4);havoc SelectionSort_#t~mem5#1;call write~int#1(SelectionSort_~temp~0#1, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0#1, 4); 4976#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4977#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4994#L26 havoc SelectionSort_#t~mem1#1, SelectionSort_#t~mem2#1, SelectionSort_#t~post3#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~post6#1, SelectionSort_~lh~0#1, SelectionSort_~rh~0#1, SelectionSort_~i~0#1, SelectionSort_~temp~0#1;assume { :end_inline_SelectionSort } true;main_~i~1#1 := 0; 4989#L49-3 [2024-10-12 00:43:48,083 INFO L747 eck$LassoCheckResult]: Loop: 4989#L49-3 assume !!(main_~i~1#1 < 5);call main_#t~mem8#1 := read~int#2(main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem8#1 == main_~i~1#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 4986#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4987#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4988#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4989#L49-3 [2024-10-12 00:43:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -795806568, now seen corresponding path program 4 times [2024-10-12 00:43:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083628071] [2024-10-12 00:43:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 4 times [2024-10-12 00:43:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972967456] [2024-10-12 00:43:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2138039688, now seen corresponding path program 1 times [2024-10-12 00:43:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:48,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55756909] [2024-10-12 00:43:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:48,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:58,714 WARN L286 SmtUtils]: Spent 10.48s on a formula simplification. DAG size of input: 451 DAG size of output: 337 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:43:59,495 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:43:59,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:43:59,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:43:59,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:43:59,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:43:59,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:59,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:43:59,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:43:59,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration20_Lasso [2024-10-12 00:43:59,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:43:59,495 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:43:59,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:59,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:00,084 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:44:00,085 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:44:00,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,086 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:44:00,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:00,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:00,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:00,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:00,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:44:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,111 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:44:00,112 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-12 00:44:00,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:00,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:00,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:00,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:44:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,134 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:44:00,135 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-12 00:44:00,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:00,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:00,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:00,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:00,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,157 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:44:00,158 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-12 00:44:00,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:00,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:00,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:00,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-12 00:44:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,181 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:44:00,182 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-12 00:44:00,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 00:44:00,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,207 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:44:00,208 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-12 00:44:00,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:44:00,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,232 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:44:00,233 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-12 00:44:00,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:44:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,256 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:44:00,259 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-12 00:44:00,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-12 00:44:00,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,283 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:44:00,284 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-12 00:44:00,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 00:44:00,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,308 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:44:00,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:00,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:00,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:44:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,334 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:44:00,335 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-12 00:44:00,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:00,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:00,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:00,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:00,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:00,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:00,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:44:00,367 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-12 00:44:00,367 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:44:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:00,368 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:00,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:44:00,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:44:00,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:44:00,382 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:44:00,382 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = -2*ULTIMATE.start_main_~i~1#1 + 9 Supporting invariants [] [2024-10-12 00:44:00,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:44:00,404 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-10-12 00:44:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:00,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:44:00,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:00,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:44:00,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:00,529 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-12 00:44:00,529 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-12 00:44:00,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 89 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-12 00:44:00,541 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 89 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 94 transitions. Complement of second has 4 states. [2024-10-12 00:44:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:44:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-12 00:44:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2024-10-12 00:44:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 4 letters. [2024-10-12 00:44:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 70 letters. Loop has 4 letters. [2024-10-12 00:44:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 8 letters. [2024-10-12 00:44:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:00,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 94 transitions. [2024-10-12 00:44:00,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:44:00,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:44:00,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:44:00,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:00,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-12 00:44:00,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:44:00,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:44:00,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:44:00,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:44:00 BoogieIcfgContainer [2024-10-12 00:44:00,549 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:44:00,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:44:00,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:44:00,550 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:44:00,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:25" (3/4) ... [2024-10-12 00:44:00,551 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:44:00,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:44:00,552 INFO L158 Benchmark]: Toolchain (without parser) took 35399.78ms. Allocated memory was 163.6MB in the beginning and 553.6MB in the end (delta: 390.1MB). Free memory was 106.9MB in the beginning and 382.7MB in the end (delta: -275.9MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,552 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:44:00,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.34ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.70ms. Allocated memory is still 163.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,553 INFO L158 Benchmark]: Boogie Preprocessor took 39.89ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,553 INFO L158 Benchmark]: RCFGBuilder took 261.88ms. Allocated memory is still 163.6MB. Free memory was 90.7MB in the beginning and 76.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,553 INFO L158 Benchmark]: BuchiAutomizer took 34841.46ms. Allocated memory was 163.6MB in the beginning and 553.6MB in the end (delta: 390.1MB). Free memory was 76.9MB in the beginning and 383.8MB in the end (delta: -306.9MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-10-12 00:44:00,553 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 553.6MB. Free memory was 383.8MB in the beginning and 382.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:44:00,554 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.11ms. Allocated memory is still 163.6MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.34ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.70ms. Allocated memory is still 163.6MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.89ms. Allocated memory is still 163.6MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.88ms. Allocated memory is still 163.6MB. Free memory was 90.7MB in the beginning and 76.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 34841.46ms. Allocated memory was 163.6MB in the beginning and 553.6MB in the end (delta: 390.1MB). Free memory was 76.9MB in the beginning and 383.8MB in the end (delta: -306.9MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 553.6MB. Free memory was 383.8MB in the beginning and 382.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (17 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (n + ((long long) -1 * lh)) and consists of 4 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. 17 modules have a trivial ranking function, the largest among these consists of 35 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.8s and 21 iterations. TraceHistogramMax:10. Analysis of lassos took 28.5s. Construction of modules took 1.5s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 3. Minimization of det autom 16. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 154 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/5 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1254 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1251 mSDsluCounter, 1417 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1124 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2316 IncrementalHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 293 mSDtfsCounter, 2316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc8 concLT0 SILN0 SILU8 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital323 mio100 ax100 hnf100 lsp85 ukn57 mio100 lsp33 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms 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-12 00:44:00,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-12 00:44:00,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:00,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2024-10-12 00:44:01,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:01,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-10-12 00:44:01,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:01,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:01,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:02,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:02,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:02,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:02,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-12 00:44:02,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:03,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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