./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:18:41,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:18:41,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:18:41,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:18:41,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:18:41,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:18:41,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:18:41,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:18:41,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:18:41,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:18:41,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:18:41,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:18:41,132 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:18:41,132 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:18:41,132 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:18:41,133 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:18:41,133 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:18:41,133 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:18:41,133 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:18:41,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:18:41,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:18:41,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:18:41,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:18:41,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:18:41,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:18:41,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:18:41,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:18:41,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:18:41,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:18:41,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:18:41,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:18:41,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:18:41,139 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:18:41,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:18:41,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:18:41,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:18:41,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:18:41,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:18:41,142 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:18:41,142 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2024-10-25 00:18:41,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:18:41,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:18:41,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:18:41,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:18:41,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:18:41,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-10-25 00:18:43,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:18:43,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:18:43,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-10-25 00:18:43,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9101e3b87/c5c19ce305354ba9aeb2dcb4d72b59d6/FLAGac5c6eb85 [2024-10-25 00:18:43,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9101e3b87/c5c19ce305354ba9aeb2dcb4d72b59d6 [2024-10-25 00:18:43,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:18:43,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:18:43,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:18:43,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:18:43,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:18:43,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359c30bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43, skipping insertion in model container [2024-10-25 00:18:43,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:18:43,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:18:43,655 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:18:43,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:18:43,736 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:18:43,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43 WrapperNode [2024-10-25 00:18:43,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:18:43,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:18:43,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:18:43,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:18:43,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,845 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-10-25 00:18:43,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:18:43,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:18:43,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:18:43,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:18:43,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,892 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-25 00:18:43,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:18:43,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:18:43,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:18:43,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:18:43,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (1/1) ... [2024-10-25 00:18:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:43,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:43,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:18:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:18:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:18:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:18:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:18:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:18:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:18:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:18:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:18:44,069 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:18:44,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:18:44,228 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-25 00:18:44,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:18:44,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:18:44,241 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-25 00:18:44,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:44 BoogieIcfgContainer [2024-10-25 00:18:44,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:18:44,242 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:18:44,242 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:18:44,246 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:18:44,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:44,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:18:43" (1/3) ... [2024-10-25 00:18:44,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d206c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:18:44, skipping insertion in model container [2024-10-25 00:18:44,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:44,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:43" (2/3) ... [2024-10-25 00:18:44,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d206c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:18:44, skipping insertion in model container [2024-10-25 00:18:44,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:44,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:44" (3/3) ... [2024-10-25 00:18:44,251 INFO L332 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2024-10-25 00:18:44,303 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:18:44,303 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:18:44,303 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:18:44,303 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:18:44,304 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:18:44,304 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:18:44,304 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:18:44,304 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:18:44,308 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-25 00:18:44,324 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-25 00:18:44,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:44,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:44,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:18:44,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:44,330 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:18:44,330 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-25 00:18:44,332 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-25 00:18:44,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:44,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:44,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:18:44,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:44,340 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-25 00:18:44,341 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-25 00:18:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-25 00:18:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241037679] [2024-10-25 00:18:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:44,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-25 00:18:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311177147] [2024-10-25 00:18:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:44,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-25 00:18:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:44,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766324134] [2024-10-25 00:18:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:44,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:45,120 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:45,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:45,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:45,122 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:45,122 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:45,122 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,122 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:45,122 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:45,122 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2024-10-25 00:18:45,122 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:45,122 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:45,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:45,761 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:18:45,765 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:18:45,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:45,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:45,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-25 00:18:45,790 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-25 00:18:45,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:45,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:45,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:45,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:45,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:45,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:45,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:45,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:45,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-25 00:18:45,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:45,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-25 00:18:45,848 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-25 00:18:45,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:45,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:45,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:45,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:45,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:45,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:45,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:45,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:45,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:45,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-25 00:18:45,898 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-25 00:18:45,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:45,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:45,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:45,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:45,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:45,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:45,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:45,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:45,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:45,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:45,943 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-25 00:18:45,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-25 00:18:45,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:45,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:45,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:45,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:45,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:45,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:45,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:45,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-25 00:18:45,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:45,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:45,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-25 00:18:45,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:46,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:18:46,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-25 00:18:46,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:46,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:46,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,073 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-25 00:18:46,075 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-25 00:18:46,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-25 00:18:46,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-25 00:18:46,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-25 00:18:46,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-25 00:18:46,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-25 00:18:46,150 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-25 00:18:46,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:46,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,188 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-25 00:18:46,192 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-25 00:18:46,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:46,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:46,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:46,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:18:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-25 00:18:46,228 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-25 00:18:46,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-25 00:18:46,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-25 00:18:46,277 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-25 00:18:46,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-25 00:18:46,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,316 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-25 00:18:46,318 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-25 00:18:46,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-25 00:18:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,359 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-25 00:18:46,362 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-25 00:18:46,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,399 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-25 00:18:46,401 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-25 00:18:46,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-25 00:18:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,437 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-25 00:18:46,440 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-25 00:18:46,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:46,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,481 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-25 00:18:46,485 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-25 00:18:46,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:46,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:46,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:46,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:46,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:46,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:46,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:18:46,535 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-25 00:18:46,535 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:18:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:46,564 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:46,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-25 00:18:46,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:18:46,583 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:18:46,583 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:18:46,584 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-25 00:18:46,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-25 00:18:46,629 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-25 00:18:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:18:46,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:18:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:46,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:18:46,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:46,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:18:46,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:46,738 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-25 00:18:46,773 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-25 00:18:46,775 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-25 00:18:46,817 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-25 00:18:46,820 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-25 00:18:46,824 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-25 00:18:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-10-25 00:18:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-25 00:18:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-25 00:18:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:46,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-25 00:18:46,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:46,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2024-10-25 00:18:46,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-25 00:18:46,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 20 states and 29 transitions. [2024-10-25 00:18:46,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-25 00:18:46,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-25 00:18:46,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2024-10-25 00:18:46,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:46,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-25 00:18:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2024-10-25 00:18:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-25 00:18:46,855 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-25 00:18:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-10-25 00:18:46,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-25 00:18:46,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-10-25 00:18:46,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:18:46,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-10-25 00:18:46,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-25 00:18:46,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:46,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:46,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-25 00:18:46,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:46,858 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-25 00:18:46,858 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-25 00:18:46,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-25 00:18:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151574544] [2024-10-25 00:18:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:46,917 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-25 00:18:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151574544] [2024-10-25 00:18:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151574544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:18:46,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539465864] [2024-10-25 00:18:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:46,921 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:46,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1679284, now seen corresponding path program 1 times [2024-10-25 00:18:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156295635] [2024-10-25 00:18:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156295635] [2024-10-25 00:18:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156295635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:18:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776999673] [2024-10-25 00:18:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:46,936 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:18:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:46,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 00:18:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 00:18:46,940 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-25 00:18:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:46,944 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2024-10-25 00:18:46,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2024-10-25 00:18:46,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:46,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2024-10-25 00:18:46,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-25 00:18:46,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-25 00:18:46,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-10-25 00:18:46,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:46,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-25 00:18:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-10-25 00:18:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-25 00:18:46,947 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-25 00:18:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-25 00:18:46,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-25 00:18:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:18:46,949 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-25 00:18:46,949 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:18:46,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-10-25 00:18:46,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:46,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:46,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:46,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-25 00:18:46,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:46,950 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-25 00:18:46,950 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-25 00:18:46,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2024-10-25 00:18:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008868713] [2024-10-25 00:18:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:46,984 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-25 00:18:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008868713] [2024-10-25 00:18:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008868713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:46,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:46,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:18:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013767861] [2024-10-25 00:18:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:46,986 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2024-10-25 00:18:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40794022] [2024-10-25 00:18:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:46,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:18:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:18:47,085 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-25 00:18:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:47,097 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-10-25 00:18:47,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-10-25 00:18:47,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2024-10-25 00:18:47,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-25 00:18:47,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-25 00:18:47,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-25 00:18:47,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:47,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-25 00:18:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-25 00:18:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-25 00:18:47,100 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-25 00:18:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-25 00:18:47,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-25 00:18:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:18:47,103 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-25 00:18:47,103 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:18:47,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-25 00:18:47,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:47,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:47,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:47,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:47,105 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-25 00:18:47,105 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-25 00:18:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-25 00:18:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172230253] [2024-10-25 00:18:47,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:47,151 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-25 00:18:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172230253] [2024-10-25 00:18:47,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172230253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775807186] [2024-10-25 00:18:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:47,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:47,154 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:47,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-25 00:18:47,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:47,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 00:18:47,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:47,256 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-25 00:18:47,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:47,274 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-25 00:18:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775807186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:47,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-25 00:18:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963407591] [2024-10-25 00:18:47,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:47,276 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2024-10-25 00:18:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935811256] [2024-10-25 00:18:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:18:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:18:47,375 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-25 00:18:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:47,419 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-25 00:18:47,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2024-10-25 00:18:47,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2024-10-25 00:18:47,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-25 00:18:47,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-25 00:18:47,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-10-25 00:18:47,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:47,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-25 00:18:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-10-25 00:18:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-25 00:18:47,423 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-25 00:18:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-25 00:18:47,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-25 00:18:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:18:47,424 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-25 00:18:47,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:18:47,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-10-25 00:18:47,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:47,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:47,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-25 00:18:47,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:47,426 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-25 00:18:47,426 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-25 00:18:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-25 00:18:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734017124] [2024-10-25 00:18:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:47,537 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-25 00:18:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734017124] [2024-10-25 00:18:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734017124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866939043] [2024-10-25 00:18:47,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:18:47,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:47,540 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:47,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-25 00:18:47,595 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:18:47,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:18:47,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:18:47,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:47,624 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-25 00:18:47,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:47,665 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-25 00:18:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866939043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:47,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-25 00:18:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021349715] [2024-10-25 00:18:47,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:47,667 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2024-10-25 00:18:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000422922] [2024-10-25 00:18:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:18:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:18:47,761 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-25 00:18:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:47,821 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-25 00:18:47,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2024-10-25 00:18:47,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2024-10-25 00:18:47,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-25 00:18:47,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-25 00:18:47,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2024-10-25 00:18:47,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:47,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-25 00:18:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2024-10-25 00:18:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2024-10-25 00:18:47,826 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-25 00:18:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-25 00:18:47,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-25 00:18:47,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:18:47,832 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-25 00:18:47,832 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:18:47,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-10-25 00:18:47,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:47,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:47,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:47,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2024-10-25 00:18:47,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:47,834 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-25 00:18:47,834 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-25 00:18:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2024-10-25 00:18:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136936563] [2024-10-25 00:18:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:47,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2024-10-25 00:18:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700432788] [2024-10-25 00:18:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:47,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2024-10-25 00:18:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868731035] [2024-10-25 00:18:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:47,982 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-25 00:18:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868731035] [2024-10-25 00:18:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868731035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:18:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53758810] [2024-10-25 00:18:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:18:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:18:48,063 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-25 00:18:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:48,107 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-25 00:18:48,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-25 00:18:48,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:18:48,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-10-25 00:18:48,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:18:48,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:18:48,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-10-25 00:18:48,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:48,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-25 00:18:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-10-25 00:18:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-10-25 00:18:48,111 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-25 00:18:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-25 00:18:48,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-25 00:18:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:18:48,113 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-25 00:18:48,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:18:48,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2024-10-25 00:18:48,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:48,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:48,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:48,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:48,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:48,119 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-25 00:18:48,119 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-25 00:18:48,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2024-10-25 00:18:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367075850] [2024-10-25 00:18:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:48,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:48,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:48,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2024-10-25 00:18:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70502856] [2024-10-25 00:18:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:48,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:48,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2024-10-25 00:18:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597424942] [2024-10-25 00:18:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:48,571 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-25 00:18:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597424942] [2024-10-25 00:18:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597424942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083856862] [2024-10-25 00:18:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:48,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:48,575 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:48,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-25 00:18:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:48,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-25 00:18:48,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:48,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 00:18:48,803 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-25 00:18:48,821 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-25 00:18:48,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-25 00:18:48,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083856862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:48,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-25 00:18:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-25 00:18:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635085745] [2024-10-25 00:18:48,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:18:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-25 00:18:48,903 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-25 00:18:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:48,962 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-25 00:18:48,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-10-25 00:18:48,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:18:48,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-10-25 00:18:48,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-25 00:18:48,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-25 00:18:48,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-10-25 00:18:48,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:48,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-25 00:18:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-10-25 00:18:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-10-25 00:18:48,965 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-25 00:18:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-25 00:18:48,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-25 00:18:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:18:48,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-25 00:18:48,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:18:48,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-10-25 00:18:48,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:48,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:48,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:48,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:48,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:48,971 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-25 00:18:48,971 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-25 00:18:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2024-10-25 00:18:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386517078] [2024-10-25 00:18:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:48,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:49,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:49,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2024-10-25 00:18:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234690628] [2024-10-25 00:18:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:49,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:49,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:49,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2024-10-25 00:18:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841056374] [2024-10-25 00:18:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:49,319 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-25 00:18:49,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841056374] [2024-10-25 00:18:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841056374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755496335] [2024-10-25 00:18:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:49,322 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:49,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-25 00:18:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:49,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-25 00:18:49,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:49,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 00:18:49,651 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-25 00:18:49,715 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-25 00:18:49,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:50,027 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-25 00:18:50,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755496335] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:50,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:50,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-10-25 00:18:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518811458] [2024-10-25 00:18:50,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-25 00:18:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-10-25 00:18:50,086 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-25 00:18:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:50,404 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-25 00:18:50,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2024-10-25 00:18:50,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-10-25 00:18:50,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2024-10-25 00:18:50,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:18:50,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:18:50,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2024-10-25 00:18:50,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:50,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-25 00:18:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2024-10-25 00:18:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-10-25 00:18:50,408 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-25 00:18:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-25 00:18:50,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-25 00:18:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-25 00:18:50,409 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-25 00:18:50,409 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:18:50,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2024-10-25 00:18:50,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:50,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:50,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:50,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:50,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:50,411 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-25 00:18:50,411 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-25 00:18:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1574718017, now seen corresponding path program 1 times [2024-10-25 00:18:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486212902] [2024-10-25 00:18:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:50,469 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-25 00:18:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486212902] [2024-10-25 00:18:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486212902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738902559] [2024-10-25 00:18:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:50,472 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:50,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-25 00:18:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:50,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:18:50,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:50,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-25 00:18:50,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:50,638 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-25 00:18:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738902559] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:50,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-10-25 00:18:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878838424] [2024-10-25 00:18:50,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:50,640 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 5 times [2024-10-25 00:18:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727743112] [2024-10-25 00:18:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 00:18:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-25 00:18:50,719 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-25 00:18:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:50,863 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-25 00:18:50,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2024-10-25 00:18:50,864 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-25 00:18:50,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2024-10-25 00:18:50,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-10-25 00:18:50,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-25 00:18:50,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2024-10-25 00:18:50,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:50,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-10-25 00:18:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2024-10-25 00:18:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-25 00:18:50,868 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-25 00:18:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-25 00:18:50,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-25 00:18:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 00:18:50,869 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-25 00:18:50,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:18:50,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-25 00:18:50,870 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:18:50,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:50,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:50,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2024-10-25 00:18:50,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:50,871 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-25 00:18:50,871 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-25 00:18:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash 649240641, now seen corresponding path program 1 times [2024-10-25 00:18:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346992171] [2024-10-25 00:18:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:50,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 3 times [2024-10-25 00:18:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224885872] [2024-10-25 00:18:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:50,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1290237019, now seen corresponding path program 2 times [2024-10-25 00:18:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563430011] [2024-10-25 00:18:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:51,014 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-25 00:18:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:51,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563430011] [2024-10-25 00:18:51,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563430011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:51,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:51,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:18:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521249762] [2024-10-25 00:18:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 00:18:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-25 00:18:51,091 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-25 00:18:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:51,173 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-10-25 00:18:51,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2024-10-25 00:18:51,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:51,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 53 transitions. [2024-10-25 00:18:51,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-25 00:18:51,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-25 00:18:51,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2024-10-25 00:18:51,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:51,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-25 00:18:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2024-10-25 00:18:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-25 00:18:51,176 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-25 00:18:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-25 00:18:51,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-25 00:18:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 00:18:51,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-25 00:18:51,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:18:51,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2024-10-25 00:18:51,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:51,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:51,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:51,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:51,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:51,183 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-25 00:18:51,184 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-25 00:18:51,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash -264183975, now seen corresponding path program 1 times [2024-10-25 00:18:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69518927] [2024-10-25 00:18:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:51,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:51,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 4 times [2024-10-25 00:18:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327221261] [2024-10-25 00:18:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:51,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:51,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1924678077, now seen corresponding path program 1 times [2024-10-25 00:18:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125913387] [2024-10-25 00:18:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:51,767 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-25 00:18:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125913387] [2024-10-25 00:18:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125913387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312070372] [2024-10-25 00:18:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:51,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:51,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,771 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:51,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-25 00:18:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:51,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-25 00:18:51,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:52,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 00:18:52,335 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-25 00:18:52,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 00:18:52,498 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-25 00:18:52,524 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-25 00:18:52,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:53,125 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-25 00:18:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312070372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:53,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2024-10-25 00:18:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437983243] [2024-10-25 00:18:53,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-25 00:18:53,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2024-10-25 00:18:53,201 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-25 00:18:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:54,553 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-10-25 00:18:54,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 79 transitions. [2024-10-25 00:18:54,554 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-10-25 00:18:54,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 79 transitions. [2024-10-25 00:18:54,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-10-25 00:18:54,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-25 00:18:54,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 79 transitions. [2024-10-25 00:18:54,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:54,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-10-25 00:18:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 79 transitions. [2024-10-25 00:18:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2024-10-25 00:18:54,558 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-25 00:18:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-25 00:18:54,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-25 00:18:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-25 00:18:54,559 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-25 00:18:54,560 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-25 00:18:54,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2024-10-25 00:18:54,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:54,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:54,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:54,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:54,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:54,562 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-25 00:18:54,563 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-25 00:18:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 400231404, now seen corresponding path program 2 times [2024-10-25 00:18:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421043338] [2024-10-25 00:18:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:54,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:54,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:54,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 5 times [2024-10-25 00:18:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246208020] [2024-10-25 00:18:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:54,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:54,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 464581374, now seen corresponding path program 2 times [2024-10-25 00:18:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608979581] [2024-10-25 00:18:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:55,142 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-25 00:18:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608979581] [2024-10-25 00:18:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608979581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504688683] [2024-10-25 00:18:55,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:18:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,146 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:55,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-25 00:18:55,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:18:55,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:18:55,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-25 00:18:55,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:55,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 00:18:55,715 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-25 00:18:55,882 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-25 00:18:55,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:56,154 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-25 00:18:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504688683] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:56,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 29 [2024-10-25 00:18:56,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656985993] [2024-10-25 00:18:56,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:56,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-25 00:18:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-10-25 00:18:56,212 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-25 00:18:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:57,068 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-10-25 00:18:57,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2024-10-25 00:18:57,069 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-25 00:18:57,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 79 transitions. [2024-10-25 00:18:57,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-25 00:18:57,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-25 00:18:57,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2024-10-25 00:18:57,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:57,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-25 00:18:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2024-10-25 00:18:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2024-10-25 00:18:57,072 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-25 00:18:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-10-25 00:18:57,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-25 00:18:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-25 00:18:57,073 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-25 00:18:57,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-25 00:18:57,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2024-10-25 00:18:57,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:57,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:57,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:57,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:57,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:57,075 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-25 00:18:57,075 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-25 00:18:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676157, now seen corresponding path program 3 times [2024-10-25 00:18:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423627950] [2024-10-25 00:18:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:57,169 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-25 00:18:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423627950] [2024-10-25 00:18:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423627950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686250071] [2024-10-25 00:18:57,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:18:57,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,172 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:57,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-25 00:18:57,338 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-25 00:18:57,338 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:18:57,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:18:57,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:57,536 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-25 00:18:57,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:57,614 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-25 00:18:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686250071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:57,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 00:18:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299208251] [2024-10-25 00:18:57,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:57,616 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 6 times [2024-10-25 00:18:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796471331] [2024-10-25 00:18:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-25 00:18:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-25 00:18:57,690 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-25 00:18:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:57,822 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-25 00:18:57,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 62 transitions. [2024-10-25 00:18:57,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:18:57,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 62 transitions. [2024-10-25 00:18:57,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-25 00:18:57,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-25 00:18:57,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2024-10-25 00:18:57,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:57,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-25 00:18:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2024-10-25 00:18:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-25 00:18:57,826 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-25 00:18:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-25 00:18:57,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-25 00:18:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-25 00:18:57,828 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-25 00:18:57,828 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-25 00:18:57,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2024-10-25 00:18:57,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-25 00:18:57,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:57,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:57,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:57,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:18:57,830 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-25 00:18:57,830 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-25 00:18:57,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 464581376, now seen corresponding path program 4 times [2024-10-25 00:18:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606033865] [2024-10-25 00:18:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:57,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 6 times [2024-10-25 00:18:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286403692] [2024-10-25 00:18:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:57,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1959183210, now seen corresponding path program 3 times [2024-10-25 00:18:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216682063] [2024-10-25 00:18:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:58,003 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-25 00:18:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216682063] [2024-10-25 00:18:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216682063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215618496] [2024-10-25 00:18:58,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:18:58,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:58,008 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:18:58,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-25 00:18:58,093 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 00:18:58,093 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:18:58,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-25 00:18:58,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 00:18:58,166 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-25 00:18:58,167 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-25 00:18:58,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 00:18:58,179 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-25 00:18:58,827 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-25 00:18:59,137 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-10-25 00:18:59,138 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-25 00:18:59,159 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-25 00:18:59,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:00,074 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-25 00:19:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215618496] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:00,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-10-25 00:19:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758794209] [2024-10-25 00:19:00,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-25 00:19:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-10-25 00:19:00,122 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-25 00:19:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:04,470 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-10-25 00:19:04,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 100 transitions. [2024-10-25 00:19:04,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-25 00:19:04,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 100 transitions. [2024-10-25 00:19:04,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-10-25 00:19:04,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-10-25 00:19:04,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 100 transitions. [2024-10-25 00:19:04,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:04,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-10-25 00:19:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 100 transitions. [2024-10-25 00:19:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2024-10-25 00:19:04,489 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-25 00:19:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-25 00:19:04,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-25 00:19:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-25 00:19:04,497 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-25 00:19:04,497 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-25 00:19:04,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2024-10-25 00:19:04,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-25 00:19:04,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:04,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:04,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:04,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1] [2024-10-25 00:19:04,498 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-25 00:19:04,502 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-25 00:19:04,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 5 times [2024-10-25 00:19:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321937085] [2024-10-25 00:19:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1388052987, now seen corresponding path program 1 times [2024-10-25 00:19:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266971016] [2024-10-25 00:19:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:04,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -984435007, now seen corresponding path program 6 times [2024-10-25 00:19:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261576269] [2024-10-25 00:19:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:04,922 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-25 00:19:04,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261576269] [2024-10-25 00:19:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261576269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886688088] [2024-10-25 00:19:04,922 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-25 00:19:04,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:04,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,925 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:04,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-25 00:19:05,066 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-25 00:19:05,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:19:05,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:19:05,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:05,236 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-25 00:19:05,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:05,381 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-25 00:19:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886688088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:05,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:05,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-25 00:19:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22474965] [2024-10-25 00:19:05,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:05,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:05,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-25 00:19:05,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-25 00:19:05,640 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-25 00:19:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:05,753 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-10-25 00:19:05,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-10-25 00:19:05,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-25 00:19:05,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-10-25 00:19:05,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2024-10-25 00:19:05,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-10-25 00:19:05,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-10-25 00:19:05,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:05,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-25 00:19:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-10-25 00:19:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-10-25 00:19:05,762 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-25 00:19:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-25 00:19:05,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-25 00:19:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 00:19:05,767 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-25 00:19:05,767 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-25 00:19:05,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2024-10-25 00:19:05,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-25 00:19:05,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:05,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:05,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:05,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-25 00:19:05,768 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-25 00:19:05,772 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-25 00:19:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 7 times [2024-10-25 00:19:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991658615] [2024-10-25 00:19:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -685142247, now seen corresponding path program 2 times [2024-10-25 00:19:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776232400] [2024-10-25 00:19:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:05,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1269305379, now seen corresponding path program 8 times [2024-10-25 00:19:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104130535] [2024-10-25 00:19:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:05,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:11,545 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:11,546 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:11,546 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:11,546 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:11,546 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:11,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:11,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:11,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:11,546 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration16_Lasso [2024-10-25 00:19:11,546 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:11,547 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:11,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:11,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:12,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:12,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:13,230 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:13,230 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:13,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,237 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-25 00:19:13,246 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-25 00:19:13,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,279 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-25 00:19:13,282 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-25 00:19:13,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-25 00:19:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,314 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-25 00:19:13,316 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-25 00:19:13,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-25 00:19:13,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,349 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-25 00:19:13,355 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-25 00:19:13,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-25 00:19:13,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,416 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-25 00:19:13,421 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-25 00:19:13,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,468 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-25 00:19:13,469 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-25 00:19:13,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-25 00:19:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,505 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-25 00:19:13,506 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-25 00:19:13,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-25 00:19:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,538 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-25 00:19:13,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:13,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-25 00:19:13,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,573 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-25 00:19:13,575 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-25 00:19:13,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,616 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-25 00:19:13,620 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-25 00:19:13,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:13,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:13,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:13,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-25 00:19:13,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,661 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-25 00:19:13,663 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-25 00:19:13,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-25 00:19:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,695 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-25 00:19:13,697 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-25 00:19:13,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,731 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-25 00:19:13,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-25 00:19:13,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-25 00:19:13,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,765 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-25 00:19:13,772 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-25 00:19:13,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,805 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-25 00:19:13,809 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-25 00:19:13,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,847 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-25 00:19:13,849 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-25 00:19:13,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-25 00:19:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,893 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-25 00:19:13,896 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-25 00:19:13,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,929 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-25 00:19:13,931 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-25 00:19:13,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:13,965 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:13,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-25 00:19:13,968 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-25 00:19:13,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:13,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:13,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:13,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:13,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:13,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:13,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:13,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:14,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,033 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-25 00:19:14,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:14,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-25 00:19:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,069 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-25 00:19:14,071 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-25 00:19:14,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:14,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,105 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-25 00:19:14,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:14,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,145 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-25 00:19:14,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:14,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:14,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,183 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-25 00:19:14,185 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-25 00:19:14,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,219 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-25 00:19:14,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-25 00:19:14,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:14,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-25 00:19:14,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,323 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-25 00:19:14,326 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-25 00:19:14,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:14,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:14,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:14,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:14,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:14,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:14,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:14,401 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-25 00:19:14,402 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-10-25 00:19:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,404 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-25 00:19:14,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:14,421 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:14,421 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:14,421 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-25 00:19:14,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-25 00:19:14,486 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2024-10-25 00:19:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:14,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:14,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:14,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:14,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:14,632 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-25 00:19:14,633 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-25 00:19:14,633 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-25 00:19:14,657 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-25 00:19:14,658 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-25 00:19:14,658 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-25 00:19:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-25 00:19:14,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 10 letters. [2024-10-25 00:19:14,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:14,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 48 letters. Loop has 10 letters. [2024-10-25 00:19:14,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:14,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 20 letters. [2024-10-25 00:19:14,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:14,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 90 transitions. [2024-10-25 00:19:14,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:14,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 69 states and 76 transitions. [2024-10-25 00:19:14,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-25 00:19:14,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:19:14,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 76 transitions. [2024-10-25 00:19:14,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:14,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-10-25 00:19:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 76 transitions. [2024-10-25 00:19:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-25 00:19:14,668 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-25 00:19:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-10-25 00:19:14,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-25 00:19:14,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-10-25 00:19:14,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-25 00:19:14,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 75 transitions. [2024-10-25 00:19:14,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:14,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:14,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:14,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:14,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:19:14,672 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-25 00:19:14,673 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-25 00:19:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1714859028, now seen corresponding path program 1 times [2024-10-25 00:19:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256949212] [2024-10-25 00:19:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:14,771 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-25 00:19:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256949212] [2024-10-25 00:19:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256949212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654686693] [2024-10-25 00:19:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:14,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:14,774 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:14,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-10-25 00:19:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:14,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:19:14,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:15,017 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-25 00:19:15,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:15,087 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-25 00:19:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654686693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:15,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:15,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-25 00:19:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377070130] [2024-10-25 00:19:15,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:15,088 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 1 times [2024-10-25 00:19:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116820487] [2024-10-25 00:19:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:15,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:15,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:15,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-25 00:19:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-25 00:19:15,231 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-25 00:19:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:15,292 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-10-25 00:19:15,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 132 transitions. [2024-10-25 00:19:15,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:15,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 88 states and 98 transitions. [2024-10-25 00:19:15,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-25 00:19:15,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-25 00:19:15,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2024-10-25 00:19:15,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:15,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-25 00:19:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2024-10-25 00:19:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-10-25 00:19:15,296 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-25 00:19:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-25 00:19:15,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-25 00:19:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:19:15,308 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-25 00:19:15,308 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-25 00:19:15,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 88 transitions. [2024-10-25 00:19:15,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:15,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:15,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:15,309 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:15,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:19:15,310 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-25 00:19:15,310 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-25 00:19:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash 666849612, now seen corresponding path program 2 times [2024-10-25 00:19:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387398769] [2024-10-25 00:19:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:15,420 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-25 00:19:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:15,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387398769] [2024-10-25 00:19:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387398769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:15,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:15,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:19:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223742136] [2024-10-25 00:19:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:15,421 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:15,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 2 times [2024-10-25 00:19:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143881010] [2024-10-25 00:19:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:15,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:15,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:19:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:19:15,507 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-25 00:19:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:15,559 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-10-25 00:19:15,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 95 transitions. [2024-10-25 00:19:15,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:15,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 82 states and 88 transitions. [2024-10-25 00:19:15,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:19:15,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:19:15,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 88 transitions. [2024-10-25 00:19:15,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:15,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-25 00:19:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 88 transitions. [2024-10-25 00:19:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-25 00:19:15,563 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-25 00:19:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-10-25 00:19:15,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-25 00:19:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:19:15,565 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-10-25 00:19:15,565 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-25 00:19:15,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 85 transitions. [2024-10-25 00:19:15,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:15,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:15,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:15,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:15,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:19:15,567 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-25 00:19:15,567 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-25 00:19:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2101796860, now seen corresponding path program 3 times [2024-10-25 00:19:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764344502] [2024-10-25 00:19:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:15,732 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-25 00:19:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764344502] [2024-10-25 00:19:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764344502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958478955] [2024-10-25 00:19:15,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:19:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:15,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:15,735 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:15,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-10-25 00:19:15,887 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-25 00:19:15,887 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:19:15,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:15,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:15,987 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-25 00:19:15,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:16,084 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-25 00:19:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958478955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:16,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-25 00:19:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921211928] [2024-10-25 00:19:16,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:16,085 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:16,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 3 times [2024-10-25 00:19:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:16,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443147661] [2024-10-25 00:19:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:16,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 00:19:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-25 00:19:16,161 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-25 00:19:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:16,677 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-10-25 00:19:16,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 112 transitions. [2024-10-25 00:19:16,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:16,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 95 states and 102 transitions. [2024-10-25 00:19:16,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:19:16,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-25 00:19:16,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-10-25 00:19:16,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:16,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-10-25 00:19:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-10-25 00:19:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2024-10-25 00:19:16,684 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-25 00:19:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-10-25 00:19:16,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-25 00:19:16,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-25 00:19:16,689 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-25 00:19:16,689 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-25 00:19:16,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 89 transitions. [2024-10-25 00:19:16,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-25 00:19:16,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:16,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:16,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:16,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:19:16,690 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-25 00:19:16,691 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-25 00:19:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -795806568, now seen corresponding path program 4 times [2024-10-25 00:19:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169218519] [2024-10-25 00:19:16,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 4 times [2024-10-25 00:19:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449973704] [2024-10-25 00:19:16,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:16,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2138039688, now seen corresponding path program 1 times [2024-10-25 00:19:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982568091] [2024-10-25 00:19:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:16,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:31,572 WARN L286 SmtUtils]: Spent 14.63s 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-25 00:19:32,667 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:32,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:32,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:32,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:32,668 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:32,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:32,668 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:32,668 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:32,668 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration20_Lasso [2024-10-25 00:19:32,668 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:32,668 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:32,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:32,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:33,548 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:33,549 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,555 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-25 00:19:33,559 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-25 00:19:33,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:33,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:33,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:33,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:33,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,590 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-25 00:19:33,592 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-25 00:19:33,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:33,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:33,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:33,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:33,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,623 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-25 00:19:33,625 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-25 00:19:33,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:33,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:33,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:33,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-25 00:19:33,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,657 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-25 00:19:33,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-25 00:19:33,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:33,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:33,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:33,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-25 00:19:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,689 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-25 00:19:33,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:33,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-25 00:19:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,724 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-25 00:19:33,726 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-25 00:19:33,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-25 00:19:33,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,759 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-25 00:19:33,763 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-25 00:19:33,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,801 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-25 00:19:33,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:33,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-25 00:19:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,839 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-25 00:19:33,842 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-25 00:19:33,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:33,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,877 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-25 00:19:33,879 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-25 00:19:33,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:33,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-25 00:19:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,911 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-25 00:19:33,914 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-25 00:19:33,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:33,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:33,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:33,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:33,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:33,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:33,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:33,964 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-25 00:19:33,964 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:19:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:33,967 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:33,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-25 00:19:33,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:33,984 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:33,984 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:33,984 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-25 00:19:33,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:34,018 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-10-25 00:19:34,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:34,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:34,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:34,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:34,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:34,184 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-25 00:19:34,185 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-25 00:19:34,185 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-25 00:19:34,199 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-25 00:19:34,199 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-25 00:19:34,200 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-25 00:19:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2024-10-25 00:19:34,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 4 letters. [2024-10-25 00:19:34,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:34,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 70 letters. Loop has 4 letters. [2024-10-25 00:19:34,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:34,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 8 letters. [2024-10-25 00:19:34,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:34,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 94 transitions. [2024-10-25 00:19:34,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:19:34,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2024-10-25 00:19:34,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:19:34,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:19:34,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:19:34,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:34,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:34,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:34,203 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:34,203 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-25 00:19:34,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:19:34,203 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:19:34,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:19:34,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:19:34 BoogieIcfgContainer [2024-10-25 00:19:34,210 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:19:34,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:19:34,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:19:34,211 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:19:34,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:44" (3/4) ... [2024-10-25 00:19:34,213 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:19:34,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:19:34,214 INFO L158 Benchmark]: Toolchain (without parser) took 50811.94ms. Allocated memory was 184.5MB in the beginning and 645.9MB in the end (delta: 461.4MB). Free memory was 116.8MB in the beginning and 528.8MB in the end (delta: -412.0MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,214 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:19:34,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 184.5MB. Free memory was 116.6MB in the beginning and 158.0MB in the end (delta: -41.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.32ms. Allocated memory is still 184.5MB. Free memory was 158.0MB in the beginning and 156.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,215 INFO L158 Benchmark]: Boogie Preprocessor took 55.93ms. Allocated memory is still 184.5MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,215 INFO L158 Benchmark]: RCFGBuilder took 334.37ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 140.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,215 INFO L158 Benchmark]: BuchiAutomizer took 49967.63ms. Allocated memory was 184.5MB in the beginning and 645.9MB in the end (delta: 461.4MB). Free memory was 140.7MB in the beginning and 528.8MB in the end (delta: -388.0MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-10-25 00:19:34,215 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 645.9MB. Free memory is still 528.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:19:34,217 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.16ms. Allocated memory is still 184.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 184.5MB. Free memory was 116.6MB in the beginning and 158.0MB in the end (delta: -41.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.32ms. Allocated memory is still 184.5MB. Free memory was 158.0MB in the beginning and 156.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.93ms. Allocated memory is still 184.5MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.37ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 140.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 49967.63ms. Allocated memory was 184.5MB in the beginning and 645.9MB in the end (delta: 461.4MB). Free memory was 140.7MB in the beginning and 528.8MB in the end (delta: -388.0MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 645.9MB. Free memory is still 528.8MB. 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 49.9s and 21 iterations. TraceHistogramMax:10. Analysis of lassos took 40.8s. Construction of modules took 2.1s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 16. Minimization of nondet autom 4. Automata minimization 0.1s 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, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1251 mSDsluCounter, 1417 SdHoareTripleChecker+Invalid, 2.1s 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: 40ms 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-25 00:19:34,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:34,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:34,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:34,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:35,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:35,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:35,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:35,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:35,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-10-25 00:19:36,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:36,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:36,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-25 00:19:36,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-25 00:19:36,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE