./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 fca748b1 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-wip.dd.update-z3-fca748b-m [2024-11-20 22:38:46,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:38:46,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:38:46,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:38:46,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:38:46,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:38:46,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:38:46,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:38:46,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:38:46,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:38:46,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:38:46,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:38:46,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:38:46,515 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:38:46,515 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:38:46,516 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:38:46,516 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:38:46,519 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:38:46,520 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:38:46,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:38:46,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:38:46,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:38:46,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:38:46,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:38:46,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:38:46,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:38:46,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:38:46,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:38:46,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:38:46,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:38:46,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:38:46,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:38:46,527 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:38:46,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:38:46,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:38:46,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:38:46,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:38:46,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:38:46,528 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:38:46,529 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-11-20 22:38:46,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:38:46,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:38:46,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:38:46,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:38:46,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:38:46,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-11-20 22:38:48,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:38:48,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:38:48,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_05.i [2024-11-20 22:38:48,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e3aa076/c4916545aedc4f758e3c988a86dab481/FLAG9cbdadf4a [2024-11-20 22:38:48,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e3aa076/c4916545aedc4f758e3c988a86dab481 [2024-11-20 22:38:48,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:38:48,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:38:48,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:38:48,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:38:48,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:38:48,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:48" (1/1) ... [2024-11-20 22:38:48,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eff7f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:48, skipping insertion in model container [2024-11-20 22:38:48,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:48" (1/1) ... [2024-11-20 22:38:48,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:38:49,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:38:49,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:38:49,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:38:49,214 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:38:49,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49 WrapperNode [2024-11-20 22:38:49,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:38:49,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:38:49,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:38:49,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:38:49,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,245 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-11-20 22:38:49,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:38:49,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:38:49,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:38:49,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:38:49,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,280 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-11-20 22:38:49,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:38:49,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:38:49,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:38:49,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:38:49,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (1/1) ... [2024-11-20 22:38:49,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:49,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:49,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:38:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:38:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:38:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 22:38:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:38:49,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:38:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:38:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:38:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 22:38:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:38:49,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:38:49,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:38:49,679 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 22:38:49,683 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:38:49,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:38:49,725 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 22:38:49,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:49 BoogieIcfgContainer [2024-11-20 22:38:49,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:38:49,726 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:38:49,727 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:38:49,731 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:38:49,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:49,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:38:48" (1/3) ... [2024-11-20 22:38:49,733 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6765ffaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:38:49, skipping insertion in model container [2024-11-20 22:38:49,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:49,733 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:49" (2/3) ... [2024-11-20 22:38:49,734 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6765ffaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:38:49, skipping insertion in model container [2024-11-20 22:38:49,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:49,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:49" (3/3) ... [2024-11-20 22:38:49,735 INFO L332 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2024-11-20 22:38:49,783 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:38:49,783 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:38:49,783 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:38:49,783 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:38:49,783 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:38:49,783 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:38:49,783 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:38:49,784 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:38:49,787 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-11-20 22:38:49,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:38:49,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:49,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:49,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:38:49,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:38:49,805 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:38:49,805 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-11-20 22:38:49,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:38:49,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:49,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:49,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:38:49,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:38:49,813 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-11-20 22:38:49,814 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-11-20 22:38:49,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-20 22:38:49,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:49,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018631182] [2024-11-20 22:38:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:49,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:49,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-20 22:38:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:49,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237888872] [2024-11-20 22:38:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:49,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:49,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-20 22:38:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656102026] [2024-11-20 22:38:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:50,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:50,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:50,599 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:38:50,599 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:38:50,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:38:50,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:38:50,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:38:50,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:50,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:38:50,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:38:50,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2024-11-20 22:38:50,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:38:50,601 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:38:50,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:50,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:51,225 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:38:51,229 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:38:51,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:38:51,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:51,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:51,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:51,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:38:51,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:38:51,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-20 22:38:51,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,324 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-11-20 22:38:51,325 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-11-20 22:38:51,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:38:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:38:51,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:38:51,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,428 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-11-20 22:38:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:38:51,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:38:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:38:51,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:38:51,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,536 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-11-20 22:38:51,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,539 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:38:51,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:38:51,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,574 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:38:51,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:51,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:51,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:51,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,601 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-11-20 22:38:51,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,604 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:38:51,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-20 22:38:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,638 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:38:51,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-20 22:38:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:38:51,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-20 22:38:51,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,705 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:38:51,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,737 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-11-20 22:38:51,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,739 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:38:51,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-20 22:38:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,767 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:38:51,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:51,796 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-11-20 22:38:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,797 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:38:51,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:38:51,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:51,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:51,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:51,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:51,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:51,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:51,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:38:51,854 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-20 22:38:51,854 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:38:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:51,858 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:51,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:38:51,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:38:51,876 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:38:51,876 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:38:51,877 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-11-20 22:38:51,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:38:51,900 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-20 22:38:51,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:38:51,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:38:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:51,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:38:51,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:51,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:38:51,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,041 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:38:52,043 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-11-20 22:38:52,087 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-11-20 22:38:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:38:52,098 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-11-20 22:38:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-20 22:38:52,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-20 22:38:52,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:52,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-20 22:38:52,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:52,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-20 22:38:52,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:52,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2024-11-20 22:38:52,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:38:52,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 20 states and 29 transitions. [2024-11-20 22:38:52,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-20 22:38:52,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-20 22:38:52,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2024-11-20 22:38:52,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:52,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-20 22:38:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2024-11-20 22:38:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-20 22:38:52,130 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-11-20 22:38:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-11-20 22:38:52,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-20 22:38:52,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-20 22:38:52,132 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:38:52,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-11-20 22:38:52,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:38:52,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:52,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:52,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:38:52,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:52,133 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-11-20 22:38:52,133 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-11-20 22:38:52,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-20 22:38:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322890930] [2024-11-20 22:38:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322890930] [2024-11-20 22:38:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322890930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:38:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870393163] [2024-11-20 22:38:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:52,197 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1679284, now seen corresponding path program 1 times [2024-11-20 22:38:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586267616] [2024-11-20 22:38:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586267616] [2024-11-20 22:38:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586267616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:38:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435709753] [2024-11-20 22:38:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:52,210 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:38:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 22:38:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 22:38:52,214 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-11-20 22:38:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:52,223 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2024-11-20 22:38:52,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2024-11-20 22:38:52,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2024-11-20 22:38:52,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-20 22:38:52,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-20 22:38:52,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-11-20 22:38:52,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:52,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-20 22:38:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-11-20 22:38:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-20 22:38:52,227 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-11-20 22:38:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-20 22:38:52,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-20 22:38:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 22:38:52,228 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-20 22:38:52,229 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:38:52,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-11-20 22:38:52,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:52,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:52,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:38:52,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:52,230 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-11-20 22:38:52,230 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-11-20 22:38:52,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2024-11-20 22:38:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085200309] [2024-11-20 22:38:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085200309] [2024-11-20 22:38:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085200309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:38:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867363436] [2024-11-20 22:38:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:52,275 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2024-11-20 22:38:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280828659] [2024-11-20 22:38:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:38:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:38:52,378 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-11-20 22:38:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:52,392 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-11-20 22:38:52,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-11-20 22:38:52,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2024-11-20 22:38:52,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-20 22:38:52,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-20 22:38:52,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-20 22:38:52,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:52,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-20 22:38:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-20 22:38:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-20 22:38:52,395 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-11-20 22:38:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-20 22:38:52,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-20 22:38:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:38:52,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-20 22:38:52,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:38:52,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-20 22:38:52,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:52,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:52,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:52,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:52,401 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-11-20 22:38:52,401 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-11-20 22:38:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-20 22:38:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193154909] [2024-11-20 22:38:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:52,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193154909] [2024-11-20 22:38:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193154909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223439836] [2024-11-20 22:38:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:52,476 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-11-20 22:38:52,479 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-11-20 22:38:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:38:52,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:52,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:38:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223439836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:52,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:52,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-20 22:38:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261791892] [2024-11-20 22:38:52,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:52,584 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2024-11-20 22:38:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708512399] [2024-11-20 22:38:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:38:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:38:52,688 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-11-20 22:38:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:52,727 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-20 22:38:52,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2024-11-20 22:38:52,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2024-11-20 22:38:52,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-20 22:38:52,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-20 22:38:52,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-11-20 22:38:52,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:52,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-20 22:38:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-11-20 22:38:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-20 22:38:52,733 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-11-20 22:38:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-20 22:38:52,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-20 22:38:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:38:52,736 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-20 22:38:52,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:38:52,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-11-20 22:38:52,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:52,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:52,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:52,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-20 22:38:52,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:52,737 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-11-20 22:38:52,738 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-11-20 22:38:52,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-20 22:38:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108334904] [2024-11-20 22:38:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108334904] [2024-11-20 22:38:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108334904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897723199] [2024-11-20 22:38:52,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:38:52,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:52,862 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-11-20 22:38:52,863 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-11-20 22:38:52,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:38:52,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:38:52,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:38:52,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897723199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:52,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-20 22:38:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870658206] [2024-11-20 22:38:52,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:52,965 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:52,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2024-11-20 22:38:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579987442] [2024-11-20 22:38:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:52,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:38:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:38:53,052 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-11-20 22:38:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:53,109 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-20 22:38:53,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2024-11-20 22:38:53,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:53,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2024-11-20 22:38:53,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-20 22:38:53,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-20 22:38:53,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2024-11-20 22:38:53,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:53,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-20 22:38:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2024-11-20 22:38:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2024-11-20 22:38:53,113 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-11-20 22:38:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-20 22:38:53,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:38:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:38:53,114 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:38:53,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:38:53,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-11-20 22:38:53,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:53,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:53,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:53,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2024-11-20 22:38:53,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:53,116 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-11-20 22:38:53,116 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-11-20 22:38:53,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2024-11-20 22:38:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141473540] [2024-11-20 22:38:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2024-11-20 22:38:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542911130] [2024-11-20 22:38:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2024-11-20 22:38:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633075219] [2024-11-20 22:38:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633075219] [2024-11-20 22:38:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633075219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:38:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622909016] [2024-11-20 22:38:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:38:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:38:53,359 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-11-20 22:38:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:53,396 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-20 22:38:53,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-20 22:38:53,397 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-20 22:38:53,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-11-20 22:38:53,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-20 22:38:53,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-20 22:38:53,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-11-20 22:38:53,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:53,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-20 22:38:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-11-20 22:38:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-11-20 22:38:53,399 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-11-20 22:38:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-20 22:38:53,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-20 22:38:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:38:53,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-20 22:38:53,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:38:53,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2024-11-20 22:38:53,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:53,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:53,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:53,402 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:53,402 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:38:53,402 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-11-20 22:38:53,402 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-11-20 22:38:53,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2024-11-20 22:38:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344581245] [2024-11-20 22:38:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2024-11-20 22:38:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047590450] [2024-11-20 22:38:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2024-11-20 22:38:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131432018] [2024-11-20 22:38:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 22:38:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:53,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131432018] [2024-11-20 22:38:53,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131432018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:53,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019398042] [2024-11-20 22:38:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:53,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:53,848 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-11-20 22:38:53,849 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-11-20 22:38:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:53,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:38:53,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:54,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:38:54,106 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-11-20 22:38:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:54,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 22:38:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019398042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:54,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 22:38:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-20 22:38:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555762539] [2024-11-20 22:38:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:38:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 22:38:54,206 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-11-20 22:38:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:54,268 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-20 22:38:54,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-20 22:38:54,268 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-20 22:38:54,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-11-20 22:38:54,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-20 22:38:54,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:38:54,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-11-20 22:38:54,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:54,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-20 22:38:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-11-20 22:38:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-20 22:38:54,274 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-11-20 22:38:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-20 22:38:54,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-20 22:38:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:38:54,276 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-20 22:38:54,276 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:38:54,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-20 22:38:54,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:54,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:54,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:54,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:54,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:38:54,277 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-11-20 22:38:54,277 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-11-20 22:38:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2024-11-20 22:38:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845939928] [2024-11-20 22:38:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2024-11-20 22:38:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294446364] [2024-11-20 22:38:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2024-11-20 22:38:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146989389] [2024-11-20 22:38:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146989389] [2024-11-20 22:38:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146989389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315617372] [2024-11-20 22:38:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:54,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,622 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-11-20 22:38:54,624 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-11-20 22:38:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:54,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 22:38:54,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:54,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:38:54,959 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-11-20 22:38:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:55,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315617372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:55,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-11-20 22:38:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879324732] [2024-11-20 22:38:55,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 22:38:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-20 22:38:55,453 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-11-20 22:38:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:55,772 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-11-20 22:38:55,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2024-11-20 22:38:55,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:38:55,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 45 transitions. [2024-11-20 22:38:55,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-20 22:38:55,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:38:55,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2024-11-20 22:38:55,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:55,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-20 22:38:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2024-11-20 22:38:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-11-20 22:38:55,776 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-11-20 22:38:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-20 22:38:55,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-20 22:38:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 22:38:55,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-20 22:38:55,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:38:55,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2024-11-20 22:38:55,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:55,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:55,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:55,779 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:55,779 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:55,779 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-11-20 22:38:55,779 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-11-20 22:38:55,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1574718017, now seen corresponding path program 1 times [2024-11-20 22:38:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920906379] [2024-11-20 22:38:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920906379] [2024-11-20 22:38:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920906379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259984628] [2024-11-20 22:38:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:55,845 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-11-20 22:38:55,850 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-11-20 22:38:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:55,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:38:55,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:55,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259984628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:56,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-20 22:38:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114625415] [2024-11-20 22:38:56,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:56,037 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:56,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 5 times [2024-11-20 22:38:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722414430] [2024-11-20 22:38:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:38:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:38:56,132 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-11-20 22:38:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:56,283 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-20 22:38:56,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2024-11-20 22:38:56,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-20 22:38:56,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2024-11-20 22:38:56,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-20 22:38:56,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-20 22:38:56,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2024-11-20 22:38:56,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:56,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-11-20 22:38:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2024-11-20 22:38:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-11-20 22:38:56,288 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-11-20 22:38:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-20 22:38:56,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-20 22:38:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:38:56,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-20 22:38:56,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:38:56,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-20 22:38:56,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-20 22:38:56,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:56,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:56,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2024-11-20 22:38:56,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:38:56,291 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-11-20 22:38:56,291 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-11-20 22:38:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 649240641, now seen corresponding path program 1 times [2024-11-20 22:38:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459559477] [2024-11-20 22:38:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 3 times [2024-11-20 22:38:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971518249] [2024-11-20 22:38:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1290237019, now seen corresponding path program 2 times [2024-11-20 22:38:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362602953] [2024-11-20 22:38:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:38:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362602953] [2024-11-20 22:38:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362602953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:56,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:56,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 22:38:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624855405] [2024-11-20 22:38:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 22:38:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 22:38:56,554 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-11-20 22:38:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:56,632 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-20 22:38:56,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2024-11-20 22:38:56,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:56,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 53 transitions. [2024-11-20 22:38:56,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-20 22:38:56,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-20 22:38:56,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2024-11-20 22:38:56,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:56,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-20 22:38:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2024-11-20 22:38:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 22:38:56,638 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-11-20 22:38:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-11-20 22:38:56,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-20 22:38:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 22:38:56,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-20 22:38:56,640 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:38:56,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2024-11-20 22:38:56,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:56,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:56,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:56,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:56,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:38:56,641 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-11-20 22:38:56,641 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-11-20 22:38:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -264183975, now seen corresponding path program 1 times [2024-11-20 22:38:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125516710] [2024-11-20 22:38:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 4 times [2024-11-20 22:38:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713003822] [2024-11-20 22:38:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1924678077, now seen corresponding path program 1 times [2024-11-20 22:38:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426197634] [2024-11-20 22:38:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:38:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426197634] [2024-11-20 22:38:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426197634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122448352] [2024-11-20 22:38:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:57,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,257 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-11-20 22:38:57,259 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-11-20 22:38:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:57,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 22:38:57,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:57,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:38:57,767 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-11-20 22:38:57,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:38:57,947 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-11-20 22:38:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-20 22:38:57,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-20 22:38:58,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122448352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:58,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:58,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2024-11-20 22:38:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555552813] [2024-11-20 22:38:58,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 22:38:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 22:38:58,625 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-11-20 22:38:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:59,900 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-20 22:38:59,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 79 transitions. [2024-11-20 22:38:59,901 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-11-20 22:38:59,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 79 transitions. [2024-11-20 22:38:59,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-11-20 22:38:59,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-20 22:38:59,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 79 transitions. [2024-11-20 22:38:59,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:59,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-20 22:38:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 79 transitions. [2024-11-20 22:38:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2024-11-20 22:38:59,904 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-11-20 22:38:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-20 22:38:59,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-20 22:38:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 22:38:59,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-20 22:38:59,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-20 22:38:59,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2024-11-20 22:38:59,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:38:59,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:59,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:59,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:59,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:38:59,907 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-11-20 22:38:59,908 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-11-20 22:38:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash 400231404, now seen corresponding path program 2 times [2024-11-20 22:38:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:59,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902590219] [2024-11-20 22:38:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:59,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:59,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 5 times [2024-11-20 22:38:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503698324] [2024-11-20 22:38:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:59,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:59,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:59,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 464581374, now seen corresponding path program 2 times [2024-11-20 22:38:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150274073] [2024-11-20 22:38:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:00,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150274073] [2024-11-20 22:39:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150274073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:00,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005921337] [2024-11-20 22:39:00,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:39:00,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:00,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,480 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-11-20 22:39:00,481 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-11-20 22:39:00,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:39:00,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:00,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 22:39:00,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:00,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:39:00,930 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-11-20 22:39:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-20 22:39:01,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005921337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:01,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 29 [2024-11-20 22:39:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713961984] [2024-11-20 22:39:01,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-20 22:39:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-11-20 22:39:01,383 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-11-20 22:39:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:02,173 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-20 22:39:02,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2024-11-20 22:39:02,173 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-20 22:39:02,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 79 transitions. [2024-11-20 22:39:02,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-20 22:39:02,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-20 22:39:02,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2024-11-20 22:39:02,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:02,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-20 22:39:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2024-11-20 22:39:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2024-11-20 22:39:02,178 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-11-20 22:39:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-20 22:39:02,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-20 22:39:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 22:39:02,179 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-20 22:39:02,180 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-20 22:39:02,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2024-11-20 22:39:02,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:39:02,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:02,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:02,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:02,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:02,181 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-11-20 22:39:02,181 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-11-20 22:39:02,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676157, now seen corresponding path program 3 times [2024-11-20 22:39:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914446252] [2024-11-20 22:39:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914446252] [2024-11-20 22:39:02,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914446252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:02,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224607182] [2024-11-20 22:39:02,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:39:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,292 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-11-20 22:39:02,293 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-11-20 22:39:02,362 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 22:39:02,363 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:02,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:39:02,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:02,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224607182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:02,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-20 22:39:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208269512] [2024-11-20 22:39:02,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:02,562 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2248553, now seen corresponding path program 6 times [2024-11-20 22:39:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030018153] [2024-11-20 22:39:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 22:39:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-20 22:39:02,649 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-11-20 22:39:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:02,773 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-20 22:39:02,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 62 transitions. [2024-11-20 22:39:02,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-20 22:39:02,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 62 transitions. [2024-11-20 22:39:02,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-20 22:39:02,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-20 22:39:02,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2024-11-20 22:39:02,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:02,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-20 22:39:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2024-11-20 22:39:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-11-20 22:39:02,777 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-11-20 22:39:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-20 22:39:02,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-20 22:39:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 22:39:02,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-20 22:39:02,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-20 22:39:02,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2024-11-20 22:39:02,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:39:02,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:02,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:02,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:02,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:39:02,782 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-11-20 22:39:02,782 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-11-20 22:39:02,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 464581376, now seen corresponding path program 4 times [2024-11-20 22:39:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428302140] [2024-11-20 22:39:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:02,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 6 times [2024-11-20 22:39:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592991063] [2024-11-20 22:39:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:02,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:02,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1959183210, now seen corresponding path program 3 times [2024-11-20 22:39:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:02,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435494382] [2024-11-20 22:39:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 22:39:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435494382] [2024-11-20 22:39:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435494382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720232212] [2024-11-20 22:39:02,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:39:02,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:02,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,994 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-11-20 22:39:02,996 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-11-20 22:39:03,080 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-20 22:39:03,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:03,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-20 22:39:03,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:03,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 22:39:03,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 22:39:03,746 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-11-20 22:39:03,985 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-20 22:39:03,985 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-11-20 22:39:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:04,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:04,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720232212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:04,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:04,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-11-20 22:39:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303118886] [2024-11-20 22:39:04,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 22:39:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2024-11-20 22:39:04,680 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-11-20 22:39:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:07,381 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-20 22:39:07,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 100 transitions. [2024-11-20 22:39:07,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-20 22:39:07,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 100 transitions. [2024-11-20 22:39:07,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2024-11-20 22:39:07,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2024-11-20 22:39:07,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 100 transitions. [2024-11-20 22:39:07,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:07,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-11-20 22:39:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 100 transitions. [2024-11-20 22:39:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2024-11-20 22:39:07,391 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-11-20 22:39:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-20 22:39:07,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-20 22:39:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-20 22:39:07,393 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-20 22:39:07,393 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-20 22:39:07,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2024-11-20 22:39:07,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-20 22:39:07,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:07,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:07,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:07,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1] [2024-11-20 22:39:07,394 INFO L745 eck$LassoCheckResult]: Stem: 2924#$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; 2920#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; 2907#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); 2908#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 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); 2932#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2931#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); 2929#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 2928#L44-3 assume !(main_~i~1#1 >= 0); 2911#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; 2912#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; 2950#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); 2949#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2948#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2947#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); 2946#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2945#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2944#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); 2943#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2942#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2941#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); 2940#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2939#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2938#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2937#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); 2936#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2926#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; 2927#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; 2952#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);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); 2954#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2955#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2922#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); 2923#L33 [2024-11-20 22:39:07,395 INFO L747 eck$LassoCheckResult]: Loop: 2923#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; 2951#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 2925#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); 2905#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 2906#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; 2930#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); 2917#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 2918#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 2921#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); 2960#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; 2958#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); 2923#L33 [2024-11-20 22:39:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 5 times [2024-11-20 22:39:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038285826] [2024-11-20 22:39:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1388052987, now seen corresponding path program 1 times [2024-11-20 22:39:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599474102] [2024-11-20 22:39:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -984435007, now seen corresponding path program 6 times [2024-11-20 22:39:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904448399] [2024-11-20 22:39:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 103 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904448399] [2024-11-20 22:39:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904448399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039755452] [2024-11-20 22:39:07,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 22:39:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,580 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-11-20 22:39:07,581 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-11-20 22:39:07,686 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-20 22:39:07,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:07,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:39:07,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:07,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 54 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039755452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:07,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-20 22:39:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915341345] [2024-11-20 22:39:07,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 22:39:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-20 22:39:08,179 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-11-20 22:39:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:08,246 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-20 22:39:08,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-11-20 22:39:08,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-20 22:39:08,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-11-20 22:39:08,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2024-11-20 22:39:08,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-11-20 22:39:08,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-11-20 22:39:08,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:08,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-20 22:39:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-11-20 22:39:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-11-20 22:39:08,251 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-11-20 22:39:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-20 22:39:08,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-20 22:39:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 22:39:08,256 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-20 22:39:08,256 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-20 22:39:08,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2024-11-20 22:39:08,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-20 22:39:08,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:08,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:08,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:08,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-20 22:39:08,257 INFO L745 eck$LassoCheckResult]: Stem: 3365#$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; 3361#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; 3348#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); 3349#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 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); 3374#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3373#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); 3370#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3369#L44-3 assume !(main_~i~1#1 >= 0); 3352#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; 3353#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; 3391#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); 3390#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3389#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3388#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); 3387#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3386#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3385#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); 3384#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3383#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3382#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); 3381#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3380#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3379#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3378#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); 3346#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3347#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; 3368#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; 3393#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);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); 3395#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3396#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3364#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); 3358#L33 [2024-11-20 22:39:08,257 INFO L747 eck$LassoCheckResult]: Loop: 3358#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3359#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3392#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3366#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); 3367#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3371#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; 3372#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); 3398#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3362#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3363#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); 3358#L33 [2024-11-20 22:39:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676155, now seen corresponding path program 7 times [2024-11-20 22:39:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830910798] [2024-11-20 22:39:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:08,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash -685142247, now seen corresponding path program 2 times [2024-11-20 22:39:08,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:08,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405309192] [2024-11-20 22:39:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1269305379, now seen corresponding path program 8 times [2024-11-20 22:39:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013883660] [2024-11-20 22:39:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:08,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:12,167 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:39:12,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:39:12,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:39:12,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:39:12,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:39:12,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:12,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:39:12,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:39:12,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration16_Lasso [2024-11-20 22:39:12,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:39:12,182 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:39:12,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:12,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:13,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:13,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:13,442 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:13,442 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:13,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,444 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:39:13,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,469 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:39:13,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-20 22:39:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,491 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:39:13,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,513 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:39:13,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,535 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:39:13,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,568 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-20 22:39:13,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,599 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-20 22:39:13,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,625 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:39:13,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,645 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:39:13,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,664 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-11-20 22:39:13,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,665 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:39:13,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:13,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:13,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:13,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,697 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:39:13,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,722 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:39:13,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,745 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:39:13,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,767 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:39:13,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:13,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,791 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:39:13,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-20 22:39:13,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,830 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-11-20 22:39:13,832 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-11-20 22:39:13,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,854 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-11-20 22:39:13,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,855 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-20 22:39:13,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-20 22:39:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,879 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-20 22:39:13,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,900 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-11-20 22:39:13,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,902 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:39:13,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,923 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-11-20 22:39:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,926 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-20 22:39:13,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:13,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:13,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:13,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:13,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:13,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:13,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:13,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:13,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-20 22:39:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:13,982 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:13,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-20 22:39:13,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:14,030 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-11-20 22:39:14,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,032 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-20 22:39:14,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:14,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,064 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-20 22:39:14,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:14,086 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-11-20 22:39:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,088 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-20 22:39:14,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:14,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,111 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-20 22:39:14,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:14,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-20 22:39:14,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,167 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-20 22:39:14,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:14,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:14,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:14,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:14,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:14,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:14,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:14,198 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:14,225 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-20 22:39:14,225 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-11-20 22:39:14,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:14,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,227 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-20 22:39:14,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:14,239 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:39:14,240 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:14,240 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-11-20 22:39:14,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-20 22:39:14,285 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2024-11-20 22:39:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:14,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:14,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:14,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:39:14,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:39:14,420 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-11-20 22:39:14,421 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-11-20 22:39:14,457 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-11-20 22:39:14,457 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-11-20 22:39:14,458 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-11-20 22:39:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-20 22:39:14,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 10 letters. [2024-11-20 22:39:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 48 letters. Loop has 10 letters. [2024-11-20 22:39:14,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:14,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 38 letters. Loop has 20 letters. [2024-11-20 22:39:14,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:14,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 90 transitions. [2024-11-20 22:39:14,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:14,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 69 states and 76 transitions. [2024-11-20 22:39:14,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-20 22:39:14,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:39:14,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 76 transitions. [2024-11-20 22:39:14,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:14,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-20 22:39:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 76 transitions. [2024-11-20 22:39:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-20 22:39:14,468 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-11-20 22:39:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-11-20 22:39:14,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-20 22:39:14,468 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-20 22:39:14,469 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-20 22:39:14,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 75 transitions. [2024-11-20 22:39:14,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:14,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:14,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:14,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:14,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:14,470 INFO L745 eck$LassoCheckResult]: Stem: 3743#$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; 3738#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; 3723#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); 3724#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 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);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 3750#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 3749#L44-3 assume !(main_~i~1#1 >= 0); 3727#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; 3728#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; 3747#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); 3773#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3772#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3771#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); 3770#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3769#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3768#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); 3767#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3766#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3765#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); 3764#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3763#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3762#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3745#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); 3746#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3748#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; 3742#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); 3733#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3734#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3739#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); 3741#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3786#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3785#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); 3778#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 3779#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 3758#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 3744#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); 3719#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 3720#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 3737#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; 3732#L49-3 [2024-11-20 22:39:14,470 INFO L747 eck$LassoCheckResult]: Loop: 3732#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; 3729#L15 assume !(0 == __VERIFIER_assert_~cond#1); 3730#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 3731#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3732#L49-3 [2024-11-20 22:39:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1714859028, now seen corresponding path program 1 times [2024-11-20 22:39:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024536363] [2024-11-20 22:39:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024536363] [2024-11-20 22:39:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024536363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707363750] [2024-11-20 22:39:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:14,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:14,561 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-11-20 22:39:14,563 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-11-20 22:39:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:14,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:39:14,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:14,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-20 22:39:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707363750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:14,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-20 22:39:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926746162] [2024-11-20 22:39:14,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:14,843 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 1 times [2024-11-20 22:39:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437770185] [2024-11-20 22:39:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:14,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:14,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 22:39:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-20 22:39:14,898 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-11-20 22:39:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:14,969 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-20 22:39:14,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 132 transitions. [2024-11-20 22:39:14,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:14,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 88 states and 98 transitions. [2024-11-20 22:39:14,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-20 22:39:14,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-20 22:39:14,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2024-11-20 22:39:14,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:14,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-20 22:39:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2024-11-20 22:39:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-11-20 22:39:14,980 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-11-20 22:39:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-20 22:39:14,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-20 22:39:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:39:14,982 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-20 22:39:14,982 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-20 22:39:14,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 88 transitions. [2024-11-20 22:39:14,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:14,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:14,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:14,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:14,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:14,985 INFO L745 eck$LassoCheckResult]: Stem: 4215#$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; 4207#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; 4192#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); 4193#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 4216#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; 4229#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); 4228#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4227#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); 4221#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4220#L44-3 assume !(main_~i~1#1 >= 0); 4196#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; 4197#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; 4212#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); 4202#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4203#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); 4261#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4260#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4259#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); 4258#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4257#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4256#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); 4255#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4254#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4253#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4252#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); 4251#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4250#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; 4213#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); 4214#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4248#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4247#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); 4246#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4245#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4244#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); 4243#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4242#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4235#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4218#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);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4219#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4240#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); 4239#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4237#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; 4238#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4224#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); 4231#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4226#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; 4222#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4217#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); 4188#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4189#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4206#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; 4201#L49-3 [2024-11-20 22:39:14,985 INFO L747 eck$LassoCheckResult]: Loop: 4201#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; 4198#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4199#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4200#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4201#L49-3 [2024-11-20 22:39:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 666849612, now seen corresponding path program 2 times [2024-11-20 22:39:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503107378] [2024-11-20 22:39:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-20 22:39:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503107378] [2024-11-20 22:39:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503107378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:39:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:39:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:39:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662700395] [2024-11-20 22:39:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:39:15,077 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:15,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 2 times [2024-11-20 22:39:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496096952] [2024-11-20 22:39:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:15,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:15,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:15,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:39:15,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:39:15,129 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-11-20 22:39:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:15,157 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-20 22:39:15,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 95 transitions. [2024-11-20 22:39:15,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:15,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 82 states and 88 transitions. [2024-11-20 22:39:15,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-20 22:39:15,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-20 22:39:15,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 88 transitions. [2024-11-20 22:39:15,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:15,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-20 22:39:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 88 transitions. [2024-11-20 22:39:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-20 22:39:15,166 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-11-20 22:39:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-20 22:39:15,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-20 22:39:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:39:15,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-20 22:39:15,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-20 22:39:15,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 85 transitions. [2024-11-20 22:39:15,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:15,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:15,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:15,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:15,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:15,169 INFO L745 eck$LassoCheckResult]: Stem: 4388#$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; 4382#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; 4367#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); 4368#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 4406#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); 4404#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4402#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); 4400#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4398#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); 4393#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 4392#L44-3 assume !(main_~i~1#1 >= 0); 4371#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; 4372#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; 4386#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); 4377#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4378#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4385#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); 4441#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4440#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4438#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); 4436#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4434#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4432#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); 4430#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4429#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); 4427#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); 4426#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4391#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; 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); 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; 4439#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); 4437#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4435#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4433#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); 4431#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4423#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4420#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4390#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);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 4424#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); 4425#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4418#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4419#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4416#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); 4415#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4414#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; 4413#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); 4397#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4409#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4410#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4403#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); 4401#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4399#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; 4395#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 4389#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); 4363#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4364#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4381#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; 4376#L49-3 [2024-11-20 22:39:15,171 INFO L747 eck$LassoCheckResult]: Loop: 4376#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; 4373#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4374#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4375#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4376#L49-3 [2024-11-20 22:39:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2101796860, now seen corresponding path program 3 times [2024-11-20 22:39:15,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:15,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753889717] [2024-11-20 22:39:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 70 proven. 82 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-20 22:39:15,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753889717] [2024-11-20 22:39:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753889717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528809529] [2024-11-20 22:39:15,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:39:15,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:15,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:15,303 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-11-20 22:39:15,305 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-11-20 22:39:15,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-20 22:39:15,503 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 22:39:15,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:15,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:39:15,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-20 22:39:15,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-20 22:39:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528809529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:15,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 22:39:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502776767] [2024-11-20 22:39:15,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:15,633 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:15,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 3 times [2024-11-20 22:39:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721609396] [2024-11-20 22:39:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:15,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:15,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:15,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:39:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:39:15,690 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-11-20 22:39:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:15,958 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-11-20 22:39:15,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 112 transitions. [2024-11-20 22:39:15,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:15,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 95 states and 102 transitions. [2024-11-20 22:39:15,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-20 22:39:15,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-20 22:39:15,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-11-20 22:39:15,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:15,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-20 22:39:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-11-20 22:39:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2024-11-20 22:39:15,963 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-11-20 22:39:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-20 22:39:15,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-20 22:39:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 22:39:15,964 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-20 22:39:15,964 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-20 22:39:15,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 89 transitions. [2024-11-20 22:39:15,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:39:15,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:15,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:15,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:15,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:15,966 INFO L745 eck$LassoCheckResult]: Stem: 5001#$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; 4993#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; 4978#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); 4979#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 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; 5002#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);call write~int#2(main_~i~1#1, main_~#array~1#1.base, main_~#array~1#1.offset + 4 * main_~i~1#1, 4); 5008#L44-2 main_#t~post7#1 := main_~i~1#1;main_~i~1#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 5007#L44-3 assume !(main_~i~1#1 >= 0); 4982#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; 4983#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; 4997#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); 4998#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); 4990#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 4991#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4996#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); 5050#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5054#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5053#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; 5051#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 4999#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5000#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);SelectionSort_~rh~0#1 := SelectionSort_~lh~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_~lh~0#1; 5006#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); 5047#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5046#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5045#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); 5044#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5043#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5042#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); 5041#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5040#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5039#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5038#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); 5037#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5036#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; 5035#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); 5034#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; 5032#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); 5030#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5031#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5026#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5027#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); 5022#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5023#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; 5019#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); 5018#L33 assume !(SelectionSort_#t~mem1#1 < SelectionSort_#t~mem2#1);havoc SelectionSort_#t~mem1#1;havoc SelectionSort_#t~mem2#1; 5017#L32-2 SelectionSort_#t~post3#1 := SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 1 + SelectionSort_#t~post3#1;havoc SelectionSort_#t~post3#1; 5015#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5014#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); 5013#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 5004#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; 5005#L32-3 assume !(SelectionSort_~i~0#1 < ~n~0); 5003#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); 4974#L30-2 SelectionSort_#t~post6#1 := SelectionSort_~lh~0#1;SelectionSort_~lh~0#1 := 1 + SelectionSort_#t~post6#1;havoc SelectionSort_#t~post6#1; 4975#L30-3 assume !(SelectionSort_~lh~0#1 < ~n~0); 4992#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; 4987#L49-3 [2024-11-20 22:39:15,967 INFO L747 eck$LassoCheckResult]: Loop: 4987#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; 4984#L15 assume !(0 == __VERIFIER_assert_~cond#1); 4985#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 4986#L49-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4987#L49-3 [2024-11-20 22:39:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash -795806568, now seen corresponding path program 4 times [2024-11-20 22:39:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855244550] [2024-11-20 22:39:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:16,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2692209, now seen corresponding path program 4 times [2024-11-20 22:39:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279321391] [2024-11-20 22:39:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:16,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2138039688, now seen corresponding path program 1 times [2024-11-20 22:39:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066134806] [2024-11-20 22:39:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:16,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:30,809 WARN L286 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 451 DAG size of output: 337 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-20 22:39:31,692 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:39:31,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:39:31,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:39:31,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:39:31,692 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:39:31,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:31,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:39:31,693 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:39:31,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration20_Lasso [2024-11-20 22:39:31,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:39:31,693 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:39:31,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:31,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:32,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:32,410 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:32,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,417 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:32,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-20 22:39:32,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:32,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:32,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:32,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-20 22:39:32,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,444 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:32,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-20 22:39:32,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:32,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:32,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:32,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,465 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:32,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-20 22:39:32,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:32,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:32,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:32,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,485 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-11-20 22:39:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,487 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:32,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-20 22:39:32,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:32,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:32,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:32,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:32,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,510 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:32,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-20 22:39:32,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,533 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-11-20 22:39:32,535 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-11-20 22:39:32,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:32,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,557 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-11-20 22:39:32,558 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-11-20 22:39:32,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-11-20 22:39:32,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,579 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-11-20 22:39:32,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,580 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-11-20 22:39:32,581 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-11-20 22:39:32,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,601 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-11-20 22:39:32,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,603 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-11-20 22:39:32,604 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-11-20 22:39:32,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-20 22:39:32,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,629 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-11-20 22:39:32,631 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-11-20 22:39:32,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:32,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,660 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-11-20 22:39:32,661 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-11-20 22:39:32,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:39:32,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:32,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:32,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:32,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:32,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:32,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:32,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:32,698 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-20 22:39:32,698 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:39:32,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:32,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:32,701 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-11-20 22:39:32,703 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-11-20 22:39:32,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:32,715 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:39:32,715 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:32,715 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-11-20 22:39:32,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-20 22:39:32,735 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-11-20 22:39:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:32,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:32,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:32,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:32,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:39:32,880 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:39:32,881 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-11-20 22:39:32,893 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-11-20 22:39:32,893 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-11-20 22:39:32,894 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-11-20 22:39:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2024-11-20 22:39:32,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 4 letters. [2024-11-20 22:39:32,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:32,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 70 letters. Loop has 4 letters. [2024-11-20 22:39:32,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:32,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-20 22:39:32,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:32,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 94 transitions. [2024-11-20 22:39:32,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:39:32,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2024-11-20 22:39:32,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:39:32,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:39:32,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:39:32,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:32,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:32,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:32,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:32,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-20 22:39:32,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:39:32,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:39:32,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:39:32,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:39:32 BoogieIcfgContainer [2024-11-20 22:39:32,904 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:39:32,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:39:32,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:39:32,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:39:32,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:49" (3/4) ... [2024-11-20 22:39:32,910 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:39:32,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:39:32,911 INFO L158 Benchmark]: Toolchain (without parser) took 43999.19ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 80.4MB in the beginning and 307.7MB in the end (delta: -227.3MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,911 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:32,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.21ms. Allocated memory is still 163.6MB. Free memory was 80.2MB in the beginning and 132.5MB in the end (delta: -52.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 163.6MB. Free memory was 132.5MB in the beginning and 130.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,912 INFO L158 Benchmark]: Boogie Preprocessor took 63.69ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,912 INFO L158 Benchmark]: RCFGBuilder took 414.84ms. Allocated memory is still 163.6MB. Free memory was 128.5MB in the beginning and 131.1MB in the end (delta: -2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,912 INFO L158 Benchmark]: BuchiAutomizer took 43177.51ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 131.1MB in the beginning and 308.7MB in the end (delta: -177.7MB). Peak memory consumption was 156.7MB. Max. memory is 16.1GB. [2024-11-20 22:39:32,913 INFO L158 Benchmark]: Witness Printer took 6.23ms. Allocated memory is still 497.0MB. Free memory was 308.7MB in the beginning and 307.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:32,914 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.18ms. Allocated memory is still 163.6MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.21ms. Allocated memory is still 163.6MB. Free memory was 80.2MB in the beginning and 132.5MB in the end (delta: -52.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 163.6MB. Free memory was 132.5MB in the beginning and 130.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.69ms. Allocated memory is still 163.6MB. Free memory was 130.5MB in the beginning and 128.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.84ms. Allocated memory is still 163.6MB. Free memory was 128.5MB in the beginning and 131.1MB in the end (delta: -2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 43177.51ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 131.1MB in the beginning and 308.7MB in the end (delta: -177.7MB). Peak memory consumption was 156.7MB. Max. memory is 16.1GB. * Witness Printer took 6.23ms. Allocated memory is still 497.0MB. Free memory was 308.7MB in the beginning and 307.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (17 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (n + ((long long) -1 * lh)) and consists of 4 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. 17 modules have a trivial ranking function, the largest among these consists of 35 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.1s and 21 iterations. TraceHistogramMax:10. Analysis of lassos took 36.2s. Construction of modules took 1.6s. Büchi inclusion checks took 5.0s. 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, 1246 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1134 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2266 IncrementalHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 293 mSDtfsCounter, 2266 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: 27ms 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-11-20 22:39:32,931 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-11-20 22:39:33,132 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-11-20 22:39:33,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2024-11-20 22:39:33,532 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-11-20 22:39:33,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-20 22:39:33,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-20 22:39:34,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-20 22:39:34,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-20 22:39:34,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:34,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-20 22:39:34,933 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-11-20 22:39:35,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:35,538 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