./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:41:03,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:41:03,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:41:03,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:41:03,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:41:03,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:41:03,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:41:03,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:41:03,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:41:03,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:41:03,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:41:03,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:41:03,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:41:03,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:41:03,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:41:03,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:41:03,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:41:03,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:41:03,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:41:03,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:41:03,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:41:03,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:41:03,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:41:03,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:41:03,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:41:03,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:41:03,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:41:03,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:41:03,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:41:03,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:41:03,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:41:03,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:41:03,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:41:03,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:41:03,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:41:03,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:41:03,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:41:03,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:41:03,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:41:03,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:41:03,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:41:03,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:41:03,568 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:41:03,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:41:03,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:41:03,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:41:03,570 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:41:03,570 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:41:03,570 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:41:03,571 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:41:03,571 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:41:03,571 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:41:03,571 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:41:03,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:41:03,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:41:03,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:41:03,573 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:41:03,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:41:03,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:41:03,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:41:03,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:41:03,574 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:41:03,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:41:03,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:41:03,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:41:03,574 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:41:03,575 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:41:03,576 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2020-10-20 06:41:03,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:41:03,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:41:03,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:41:03,801 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:41:03,802 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:41:03,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-10-20 06:41:03,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde5f043/dbb0f0c30e494079b6407b978e6ecbe1/FLAG4537fc583 [2020-10-20 06:41:04,533 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:41:04,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2020-10-20 06:41:04,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde5f043/dbb0f0c30e494079b6407b978e6ecbe1/FLAG4537fc583 [2020-10-20 06:41:04,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde5f043/dbb0f0c30e494079b6407b978e6ecbe1 [2020-10-20 06:41:04,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:41:04,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:41:04,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:41:04,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:41:04,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:41:04,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:41:04" (1/1) ... [2020-10-20 06:41:04,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a98a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:04, skipping insertion in model container [2020-10-20 06:41:04,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:41:04" (1/1) ... [2020-10-20 06:41:04,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:41:04,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:41:05,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:41:05,170 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:41:05,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:41:05,299 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:41:05,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05 WrapperNode [2020-10-20 06:41:05,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:41:05,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:41:05,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:41:05,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:41:05,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:41:05,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:41:05,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:41:05,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:41:05,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... [2020-10-20 06:41:05,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:41:05,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:41:05,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:41:05,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:41:05,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:41:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:41:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:41:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:41:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:41:05,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:41:05,777 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:41:05,777 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:41:05,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:41:05 BoogieIcfgContainer [2020-10-20 06:41:05,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:41:05,780 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:41:05,780 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:41:05,784 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:41:05,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:41:05,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:41:04" (1/3) ... [2020-10-20 06:41:05,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69770fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:41:05, skipping insertion in model container [2020-10-20 06:41:05,788 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:41:05,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:41:05" (2/3) ... [2020-10-20 06:41:05,788 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69770fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:41:05, skipping insertion in model container [2020-10-20 06:41:05,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:41:05,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:41:05" (3/3) ... [2020-10-20 06:41:05,791 INFO L373 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2020-10-20 06:41:05,839 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:41:05,840 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:41:05,840 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:41:05,840 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:41:05,841 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:41:05,841 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:41:05,842 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:41:05,842 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:41:05,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:41:05,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:41:05,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:05,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:05,899 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:41:05,900 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:41:05,900 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:41:05,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:41:05,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:41:05,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:05,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:05,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:41:05,904 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:41:05,912 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2020-10-20 06:41:05,913 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2020-10-20 06:41:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 06:41:05,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:05,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667965825] [2020-10-20 06:41:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2020-10-20 06:41:06,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226291404] [2020-10-20 06:41:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:06,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226291404] [2020-10-20 06:41:06,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:41:06,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:41:06,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594889413] [2020-10-20 06:41:06,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:41:06,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:41:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:41:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:41:06,149 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-20 06:41:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:41:06,154 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-10-20 06:41:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:41:06,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-10-20 06:41:06,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:41:06,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2020-10-20 06:41:06,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:41:06,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:41:06,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-10-20 06:41:06,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:41:06,164 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:41:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-10-20 06:41:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-20 06:41:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:41:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-10-20 06:41:06,190 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:41:06,190 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-20 06:41:06,190 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:41:06,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-10-20 06:41:06,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 06:41:06,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:06,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:06,191 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:41:06,192 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:41:06,192 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2020-10-20 06:41:06,192 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2020-10-20 06:41:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-20 06:41:06,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293039604] [2020-10-20 06:41:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2020-10-20 06:41:06,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061523032] [2020-10-20 06:41:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:06,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061523032] [2020-10-20 06:41:06,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:41:06,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:41:06,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313559111] [2020-10-20 06:41:06,281 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:41:06,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:41:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:41:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:41:06,282 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 06:41:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:41:06,307 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-10-20 06:41:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:41:06,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2020-10-20 06:41:06,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:41:06,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2020-10-20 06:41:06,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:41:06,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:41:06,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-10-20 06:41:06,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:41:06,311 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:41:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-10-20 06:41:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-20 06:41:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:41:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-20 06:41:06,314 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:41:06,314 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:41:06,314 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:41:06,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-20 06:41:06,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:41:06,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:06,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:06,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:41:06,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:41:06,316 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2020-10-20 06:41:06,316 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2020-10-20 06:41:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2020-10-20 06:41:06,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990721749] [2020-10-20 06:41:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2020-10-20 06:41:06,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601449528] [2020-10-20 06:41:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2020-10-20 06:41:06,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:06,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896132380] [2020-10-20 06:41:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:06,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:06,482 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:06,671 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-10-20 06:41:06,882 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-20 06:41:06,952 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:41:06,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:41:06,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:41:06,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:41:06,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:41:06,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:06,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:41:06,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:41:06,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2020-10-20 06:41:06,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:41:06,955 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:41:06,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:06,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:06,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:06,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,157 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-20 06:41:07,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:07,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:41:07,756 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:07,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:07,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:07,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:07,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:07,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:07,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:07,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:07,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:41:07,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:07,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:07,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:07,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:07,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:07,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:07,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:07,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:07,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:07,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:07,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:07,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:07,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:07,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:07,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:07,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:07,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:07,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:07,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:07,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:07,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:07,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:07,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:07,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:07,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:07,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:07,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:07,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:07,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:07,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:07,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:08,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:08,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:08,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:41:08,100 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:41:08,100 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:08,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:08,161 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:41:08,162 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:41:08,163 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset >= 0] [2020-10-20 06:41:08,296 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2020-10-20 06:41:08,306 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:41:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:08,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:41:08,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:08,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:41:08,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:08,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:41:08,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-10-20 06:41:08,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2020-10-20 06:41:08,596 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 [2020-10-20 06:41:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:41:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-10-20 06:41:08,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-20 06:41:08,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:08,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-20 06:41:08,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:08,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-20 06:41:08,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:08,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2020-10-20 06:41:08,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:08,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2020-10-20 06:41:08,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:41:08,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:41:08,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-20 06:41:08,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:41:08,605 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:41:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-20 06:41:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-20 06:41:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:41:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-20 06:41:08,608 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 06:41:08,608 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 06:41:08,608 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:41:08,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-20 06:41:08,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:08,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:08,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:08,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:41:08,610 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:41:08,610 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 177#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 178#L566 assume !(main_~array_size~0 < 1); 179#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 180#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 182#L554-3 [2020-10-20 06:41:08,610 INFO L796 eck$LassoCheckResult]: Loop: 182#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 187#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 184#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 182#L554-3 [2020-10-20 06:41:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-20 06:41:08,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:08,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770407374] [2020-10-20 06:41:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,632 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-20 06:41:08,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:08,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841991564] [2020-10-20 06:41:08,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-20 06:41:08,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:08,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628470172] [2020-10-20 06:41:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:08,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:08,683 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:08,871 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-20 06:41:08,923 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:41:08,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:41:08,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:41:08,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:41:08,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:41:08,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:08,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:41:08,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:41:08,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2020-10-20 06:41:08,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:41:08,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:41:08,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:08,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,079 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-10-20 06:41:09,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:09,517 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:41:09,518 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:41:09,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:09,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:09,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:09,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:09,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:09,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:09,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:09,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:09,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:09,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:09,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:09,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:09,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:09,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:09,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:09,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:09,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:09,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:09,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:09,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:41:10,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:10,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:10,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:10,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:10,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:10,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:10,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:10,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:10,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:10,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:10,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:10,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:10,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:10,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:10,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:10,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:10,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:41:10,161 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:41:10,162 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:10,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:41:10,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:41:10,171 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:41:10,171 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2020-10-20 06:41:10,203 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:41:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:10,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:41:10,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:10,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:41:10,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:10,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:41:10,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-20 06:41:10,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2020-10-20 06:41:10,277 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 [2020-10-20 06:41:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:41:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-10-20 06:41:10,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 06:41:10,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:10,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 06:41:10,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:10,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:41:10,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:10,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2020-10-20 06:41:10,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:10,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2020-10-20 06:41:10,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:41:10,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-20 06:41:10,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2020-10-20 06:41:10,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:41:10,304 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 06:41:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2020-10-20 06:41:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-10-20 06:41:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:41:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-20 06:41:10,312 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 06:41:10,312 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 06:41:10,312 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:41:10,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-20 06:41:10,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:10,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:10,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:10,314 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:41:10,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:41:10,316 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 290#L566 assume !(main_~array_size~0 < 1); 291#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 292#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 294#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 300#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 297#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 298#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 301#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 288#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 295#L554-3 [2020-10-20 06:41:10,317 INFO L796 eck$LassoCheckResult]: Loop: 295#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 299#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 296#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 295#L554-3 [2020-10-20 06:41:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2020-10-20 06:41:10,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:10,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864058549] [2020-10-20 06:41:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:10,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864058549] [2020-10-20 06:41:10,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523988069] [2020-10-20 06:41:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:41:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:10,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:41:10,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:10,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:41:10,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:41:10,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952042347] [2020-10-20 06:41:10,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:41:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-20 06:41:10,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:10,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604883176] [2020-10-20 06:41:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:10,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:41:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:41:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:41:10,546 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-10-20 06:41:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:41:10,611 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-10-20 06:41:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:41:10,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-10-20 06:41:10,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:10,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2020-10-20 06:41:10,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:41:10,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:41:10,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2020-10-20 06:41:10,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:41:10,615 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:41:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2020-10-20 06:41:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-10-20 06:41:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:41:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-10-20 06:41:10,618 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 06:41:10,618 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-20 06:41:10,618 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:41:10,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-10-20 06:41:10,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:41:10,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:41:10,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:41:10,619 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:41:10,620 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:41:10,620 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 377#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 378#L566 assume !(main_~array_size~0 < 1); 379#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 380#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 384#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 394#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 387#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 388#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 390#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 391#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 393#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 392#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 382#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 385#L554-3 [2020-10-20 06:41:10,620 INFO L796 eck$LassoCheckResult]: Loop: 385#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 389#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 386#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 385#L554-3 [2020-10-20 06:41:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2020-10-20 06:41:10,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:10,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345351407] [2020-10-20 06:41:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-20 06:41:10,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:10,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027196923] [2020-10-20 06:41:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2020-10-20 06:41:10,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:41:10,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386697965] [2020-10-20 06:41:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:41:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:41:10,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:41:10,766 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:41:11,198 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2020-10-20 06:41:11,304 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:41:11,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:41:11,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:41:11,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:41:11,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:41:11,305 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:11,305 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:41:11,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:41:11,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2020-10-20 06:41:11,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:41:11,305 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:41:11,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,507 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-10-20 06:41:11,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:11,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:41:12,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:41:12,019 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:12,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:12,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:41:12,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:12,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:12,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:12,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:12,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:41:12,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:12,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:41:12,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:41:12,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:41:12,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:12,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:12,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:41:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:41:12,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:41:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:41:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:41:12,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:41:12,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:41:12,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:41:12,315 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 06:41:12,315 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:41:12,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:41:12,320 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:41:12,321 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:41:12,321 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset >= 0] [2020-10-20 06:41:12,368 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:41:12,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:41:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:12,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 06:41:12,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 06:41:12,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 35 states and 48 transitions. Complement of second has 8 states. [2020-10-20 06:41:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:41:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:41:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-20 06:41:12,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:41:12,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:12,521 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:41:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:12,626 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 06:41:12,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 06:41:12,667 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 35 states and 48 transitions. Complement of second has 8 states. [2020-10-20 06:41:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:41:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:41:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-20 06:41:12,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:41:12,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:12,669 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:41:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:41:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:41:12,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:41:12,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:41:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:41:12,747 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 06:41:12,747 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 06:41:12,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 39 transitions. Complement of second has 7 states. [2020-10-20 06:41:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:41:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:41:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-20 06:41:12,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 06:41:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:41:12,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:12,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-20 06:41:12,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:41:12,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2020-10-20 06:41:12,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:41:12,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-10-20 06:41:12,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:41:12,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:41:12,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:41:12,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:41:12,808 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:41:12,808 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:41:12,808 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:41:12,808 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:41:12,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:41:12,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:41:12,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:41:12,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:41:12 BoogieIcfgContainer [2020-10-20 06:41:12,815 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:41:12,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:41:12,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:41:12,816 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:41:12,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:41:05" (3/4) ... [2020-10-20 06:41:12,821 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:41:12,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:41:12,823 INFO L168 Benchmark]: Toolchain (without parser) took 8017.52 ms. Allocated memory was 40.9 MB in the beginning and 73.4 MB in the end (delta: 32.5 MB). Free memory was 17.4 MB in the beginning and 9.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,824 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.4 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.33 ms. Allocated memory was 40.9 MB in the beginning and 43.5 MB in the end (delta: 2.6 MB). Free memory was 16.4 MB in the beginning and 19.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.13 ms. Allocated memory is still 43.5 MB. Free memory was 19.7 MB in the beginning and 17.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,827 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 43.5 MB. Free memory was 17.9 MB in the beginning and 16.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,827 INFO L168 Benchmark]: RCFGBuilder took 387.10 ms. Allocated memory is still 43.5 MB. Free memory was 16.4 MB in the beginning and 17.1 MB in the end (delta: -766.8 kB). Peak memory consumption was 6.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,828 INFO L168 Benchmark]: BuchiAutomizer took 7035.23 ms. Allocated memory was 43.5 MB in the beginning and 73.4 MB in the end (delta: 29.9 MB). Free memory was 16.9 MB in the beginning and 10.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 36.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,829 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 73.4 MB. Free memory was 10.2 MB in the beginning and 9.3 MB in the end (delta: 867.5 kB). Peak memory consumption was 867.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:41:12,833 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.4 MB in the end (delta: 43.6 kB). Peak memory consumption was 43.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 490.33 ms. Allocated memory was 40.9 MB in the beginning and 43.5 MB in the end (delta: 2.6 MB). Free memory was 16.4 MB in the beginning and 19.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 65.13 ms. Allocated memory is still 43.5 MB. Free memory was 19.7 MB in the beginning and 17.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 43.5 MB. Free memory was 17.9 MB in the beginning and 16.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 387.10 ms. Allocated memory is still 43.5 MB. Free memory was 16.4 MB in the beginning and 17.1 MB in the end (delta: -766.8 kB). Peak memory consumption was 6.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 7035.23 ms. Allocated memory was 43.5 MB in the beginning and 73.4 MB in the end (delta: 29.9 MB). Free memory was 16.9 MB in the beginning and 10.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 36.6 MB. Max. memory is 14.3 GB. * Witness Printer took 5.13 ms. Allocated memory is still 73.4 MB. Free memory was 10.2 MB in the beginning and 9.3 MB in the end (delta: 867.5 kB). Peak memory consumption was 867.5 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 81 SDtfs, 90 SDslu, 46 SDs, 0 SdLazy, 101 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax109 hnf99 lsp86 ukn79 mio100 lsp69 div100 bol100 ite100 ukn100 eq170 hnf86 smp95 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...