./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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-recursive-malloc/selectionSort_recursive.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 6ac1507c93933134ec25f982abf479335179fe0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:51:20,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:51:20,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:51:20,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:51:20,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:51:20,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:51:20,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:51:20,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:51:20,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:51:20,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:51:20,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:51:20,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:51:20,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:51:20,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:51:20,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:51:20,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:51:20,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:51:20,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:51:20,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:51:20,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:51:20,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:51:20,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:51:20,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:51:20,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:51:20,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:51:20,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:51:20,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:51:20,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:51:20,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:51:20,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:51:20,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:51:20,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:51:20,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:51:20,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:51:20,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:51:20,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:51:20,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:51:20,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:51:20,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:51:20,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:51:20,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:51:20,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:51:20,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:51:20,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:51:20,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:51:20,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:51:20,806 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:51:20,807 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:51:20,807 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:51:20,807 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:51:20,807 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:51:20,808 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:51:20,809 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:51:20,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:51:20,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:51:20,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:51:20,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:51:20,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:51:20,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:51:20,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:51:20,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:51:20,813 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:51:20,813 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:51:20,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:51:20,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:51:20,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:51:20,814 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:51:20,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:51:20,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:51:20,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:51:20,815 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:51:20,817 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:51:20,817 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 -> 6ac1507c93933134ec25f982abf479335179fe0d [2020-10-19 18:51:21,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:51:21,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:51:21,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:51:21,149 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:51:21,149 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:51:21,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2020-10-19 18:51:21,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fb414b/ea6757e091b74415b98c07a73c2def4d/FLAG722443758 [2020-10-19 18:51:21,642 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:51:21,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2020-10-19 18:51:21,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fb414b/ea6757e091b74415b98c07a73c2def4d/FLAG722443758 [2020-10-19 18:51:22,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fb414b/ea6757e091b74415b98c07a73c2def4d [2020-10-19 18:51:22,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:51:22,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:51:22,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:51:22,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:51:22,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:51:22,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c0c2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22, skipping insertion in model container [2020-10-19 18:51:22,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:51:22,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:51:22,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:51:22,266 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:51:22,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:51:22,309 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:51:22,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22 WrapperNode [2020-10-19 18:51:22,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:51:22,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:51:22,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:51:22,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:51:22,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:51:22,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:51:22,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:51:22,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:51:22,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (1/1) ... [2020-10-19 18:51:22,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:51:22,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:51:22,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:51:22,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:51:22,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (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-19 18:51:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:51:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 18:51:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:51:22,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:51:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:51:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2020-10-19 18:51:22,533 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2020-10-19 18:51:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:51:22,795 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:51:22,796 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-19 18:51:22,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:51:22 BoogieIcfgContainer [2020-10-19 18:51:22,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:51:22,799 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:51:22,800 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:51:22,805 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:51:22,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:51:22,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:51:22" (1/3) ... [2020-10-19 18:51:22,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b4c4753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:51:22, skipping insertion in model container [2020-10-19 18:51:22,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:51:22,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:51:22" (2/3) ... [2020-10-19 18:51:22,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b4c4753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:51:22, skipping insertion in model container [2020-10-19 18:51:22,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:51:22,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:51:22" (3/3) ... [2020-10-19 18:51:22,812 INFO L373 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2020-10-19 18:51:22,869 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:51:22,869 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:51:22,870 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:51:22,870 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:51:22,870 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:51:22,870 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:51:22,871 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:51:22,871 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:51:22,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-19 18:51:22,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 18:51:22,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:22,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:22,925 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:51:22,925 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:22,925 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:51:22,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-10-19 18:51:22,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-19 18:51:22,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:22,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:22,928 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-19 18:51:22,929 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 18:51:22,935 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2020-10-19 18:51:22,935 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2020-10-19 18:51:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-19 18:51:22,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:22,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129571292] [2020-10-19 18:51:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2020-10-19 18:51:23,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:23,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564987209] [2020-10-19 18:51:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,118 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2020-10-19 18:51:23,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:23,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39518397] [2020-10-19 18:51:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:23,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:23,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:23,384 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:23,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:23,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:23,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:23,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:23,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:23,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:23,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:23,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2020-10-19 18:51:23,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:23,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:23,411 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-19 18:51:23,422 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-19 18:51:23,426 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-19 18:51:23,432 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-19 18:51:23,563 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-19 18:51:23,568 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-19 18:51:23,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:23,842 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:23,849 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-19 18:51:23,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:23,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:23,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:23,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:23,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:23,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:23,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:23,860 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:23,891 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-19 18:51:23,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:23,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:23,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:23,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:23,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:23,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:23,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:23,897 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:23,926 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-19 18:51:23,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:23,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:23,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:23,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:23,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:23,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:23,945 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) [2020-10-19 18:51:23,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-19 18:51:23,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:23,991 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:51:23,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:23,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:24,002 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 18:51:24,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:24,017 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) [2020-10-19 18:51:24,059 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-19 18:51:24,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:24,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:24,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:24,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:24,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:24,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:24,075 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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:24,104 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-19 18:51:24,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:24,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:24,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:24,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:24,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:24,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:24,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:24,211 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 18:51:24,211 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. 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-19 18:51:24,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:24,230 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:51:24,231 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:24,231 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~a~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2020-10-19 18:51:24,265 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-10-19 18:51:24,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:51:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:51:24,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:24,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:24,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:24,351 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-19 18:51:24,370 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-19 18:51:24,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2020-10-19 18:51:24,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2020-10-19 18:51:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:51:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-10-19 18:51:24,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-19 18:51:24,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:24,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 18:51:24,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:24,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-19 18:51:24,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:24,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2020-10-19 18:51:24,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:51:24,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2020-10-19 18:51:24,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:51:24,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 18:51:24,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-19 18:51:24,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:51:24,458 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:51:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-19 18:51:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-19 18:51:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:51:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 18:51:24,493 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:51:24,493 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:51:24,493 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:51:24,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-19 18:51:24,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:51:24,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:24,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:24,495 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:51:24,495 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 18:51:24,496 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 120#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 121#L36-3 assume !(main_~i~0 < main_~n~0); 115#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 118#selectionSortENTRY [2020-10-19 18:51:24,496 INFO L796 eck$LassoCheckResult]: Loop: 118#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 119#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 123#L14-3 assume !(~index~0 < ~size); 124#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 116#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 118#selectionSortENTRY [2020-10-19 18:51:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2020-10-19 18:51:24,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:24,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011869040] [2020-10-19 18:51:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:24,583 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-19 18:51:24,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011869040] [2020-10-19 18:51:24,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:51:24,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:51:24,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37148453] [2020-10-19 18:51:24,590 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2020-10-19 18:51:24,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:24,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970731607] [2020-10-19 18:51:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:24,642 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-19 18:51:24,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970731607] [2020-10-19 18:51:24,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:51:24,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:51:24,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008663753] [2020-10-19 18:51:24,645 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:51:24,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:51:24,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:51:24,651 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-19 18:51:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:24,682 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-10-19 18:51:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:51:24,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-10-19 18:51:24,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:24,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 18:51:24,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:51:24,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:51:24,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-10-19 18:51:24,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:51:24,690 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:51:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-10-19 18:51:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-19 18:51:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:51:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-10-19 18:51:24,700 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:51:24,700 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-10-19 18:51:24,700 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:51:24,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-10-19 18:51:24,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:24,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:24,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:24,704 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:51:24,704 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:24,704 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 157#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 158#L36-3 assume !(main_~i~0 < main_~n~0); 152#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 154#selectionSortENTRY [2020-10-19 18:51:24,704 INFO L796 eck$LassoCheckResult]: Loop: 154#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 155#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 159#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 150#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 153#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 162#L14-3 assume !(~index~0 < ~size); 160#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 154#selectionSortENTRY [2020-10-19 18:51:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2020-10-19 18:51:24,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:24,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856198590] [2020-10-19 18:51:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:24,748 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-19 18:51:24,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856198590] [2020-10-19 18:51:24,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:51:24,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:51:24,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58146091] [2020-10-19 18:51:24,751 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2020-10-19 18:51:24,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:24,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741832486] [2020-10-19 18:51:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:24,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:24,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:24,812 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:25,026 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2020-10-19 18:51:25,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:51:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:51:25,239 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-19 18:51:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:25,252 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-10-19 18:51:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:51:25,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-10-19 18:51:25,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:25,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2020-10-19 18:51:25,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:51:25,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:51:25,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-10-19 18:51:25,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:51:25,256 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-19 18:51:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-10-19 18:51:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 18:51:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 18:51:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-10-19 18:51:25,260 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 18:51:25,260 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-19 18:51:25,260 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:51:25,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-10-19 18:51:25,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:25,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:25,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:25,262 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:25,262 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:25,263 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 194#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 195#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 200#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 201#L36-3 assume !(main_~i~0 < main_~n~0); 188#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 191#selectionSortENTRY [2020-10-19 18:51:25,263 INFO L796 eck$LassoCheckResult]: Loop: 191#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 192#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 196#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 187#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 190#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 199#L14-3 assume !(~index~0 < ~size); 197#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 189#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 191#selectionSortENTRY [2020-10-19 18:51:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2020-10-19 18:51:25,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:25,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165582716] [2020-10-19 18:51:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:25,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:25,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:25,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2020-10-19 18:51:25,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:25,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623715197] [2020-10-19 18:51:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:25,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:25,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:25,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2020-10-19 18:51:25,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:25,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699833287] [2020-10-19 18:51:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:25,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699833287] [2020-10-19 18:51:25,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161558671] [2020-10-19 18:51:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:25,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:25,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:25,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:25,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-10-19 18:51:25,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851921476] [2020-10-19 18:51:25,762 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2020-10-19 18:51:25,892 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-19 18:51:26,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 18:51:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-19 18:51:26,006 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-10-19 18:51:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:26,083 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-10-19 18:51:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:51:26,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2020-10-19 18:51:26,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:26,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2020-10-19 18:51:26,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:51:26,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:51:26,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-10-19 18:51:26,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:51:26,087 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-19 18:51:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-10-19 18:51:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 18:51:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 18:51:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-10-19 18:51:26,090 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-19 18:51:26,090 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-19 18:51:26,091 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:51:26,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-10-19 18:51:26,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:51:26,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:26,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:26,092 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-19 18:51:26,093 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:26,093 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 291#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 292#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 297#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 299#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 300#L36-3 assume !(main_~i~0 < main_~n~0); 285#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 288#selectionSortENTRY [2020-10-19 18:51:26,093 INFO L796 eck$LassoCheckResult]: Loop: 288#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 289#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 293#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 284#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 287#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 296#L14-3 assume !(~index~0 < ~size); 294#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 286#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 288#selectionSortENTRY [2020-10-19 18:51:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2020-10-19 18:51:26,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143965272] [2020-10-19 18:51:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,126 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2020-10-19 18:51:26,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023062525] [2020-10-19 18:51:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,180 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2020-10-19 18:51:26,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:26,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663653365] [2020-10-19 18:51:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:26,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:26,277 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:26,455 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2020-10-19 18:51:26,809 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-19 18:51:27,032 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:27,032 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:27,032 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:27,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:27,032 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:27,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,033 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:27,033 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:27,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2020-10-19 18:51:27,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:27,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:27,037 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-19 18:51:27,045 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-19 18:51:27,049 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-19 18:51:27,051 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-19 18:51:27,054 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-19 18:51:27,057 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-19 18:51:27,059 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-19 18:51:27,062 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-19 18:51:27,065 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-19 18:51:27,067 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-19 18:51:27,070 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-19 18:51:27,073 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-19 18:51:27,075 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-19 18:51:27,078 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-19 18:51:27,081 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-19 18:51:27,083 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-19 18:51:27,086 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-19 18:51:27,088 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-19 18:51:27,092 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-19 18:51:27,094 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-19 18:51:27,097 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-19 18:51:27,099 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-19 18:51:27,102 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-19 18:51:27,105 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-19 18:51:27,108 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-19 18:51:27,110 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-19 18:51:27,113 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-19 18:51:27,116 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-19 18:51:27,235 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-19 18:51:27,239 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-19 18:51:27,555 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:27,555 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,560 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-19 18:51:27,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,565 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,589 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-19 18:51:27,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:27,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:27,598 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) [2020-10-19 18:51:27,635 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-19 18:51:27,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,641 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,674 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-19 18:51:27,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,687 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,723 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-19 18:51:27,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,727 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-19 18:51:27,771 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-19 18:51:27,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,777 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-19 18:51:27,802 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-19 18:51:27,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,808 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-19 18:51:27,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-19 18:51:27,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,835 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-19 18:51:27,859 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-19 18:51:27,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,869 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 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-19 18:51:27,893 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-19 18:51:27,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,900 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:27,930 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-19 18:51:27,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,933 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 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-19 18:51:27,959 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-19 18:51:27,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,963 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-19 18:51:27,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-19 18:51:27,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:27,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:27,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:27,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:27,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:27,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:27,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:27,993 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-19 18:51:28,016 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-19 18:51:28,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,020 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,043 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-19 18:51:28,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,047 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-19 18:51:28,070 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-19 18:51:28,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:28,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:28,077 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-19 18:51:28,100 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-19 18:51:28,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,103 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-19 18:51:28,126 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-19 18:51:28,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,129 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 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-19 18:51:28,154 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-19 18:51:28,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,163 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:28,195 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-19 18:51:28,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,201 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,227 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-19 18:51:28,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,231 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,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-19 18:51:28,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,257 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:28,290 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-19 18:51:28,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,295 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,323 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-19 18:51:28,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,326 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,350 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-19 18:51:28,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:28,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:28,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:28,354 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,377 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-19 18:51:28,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,379 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:51:28,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:28,388 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 18:51:28,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:28,394 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:28,428 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-19 18:51:28,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:28,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:28,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:28,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:28,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:28,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:28,471 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 18:51:28,471 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:28,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:28,484 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:51:28,484 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:28,485 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, selectionSort_#in~size) = -1*selectionSort_#in~startIndex + 1*selectionSort_#in~size Supporting invariants [] [2020-10-19 18:51:28,515 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2020-10-19 18:51:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:28,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:28,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:28,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 18:51:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:28,605 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-19 18:51:28,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-10-19 18:51:28,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 48 transitions. Complement of second has 11 states. [2020-10-19 18:51:28,677 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-19 18:51:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-10-19 18:51:28,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2020-10-19 18:51:28,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:28,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2020-10-19 18:51:28,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:28,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2020-10-19 18:51:28,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:28,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2020-10-19 18:51:28,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:51:28,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2020-10-19 18:51:28,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:51:28,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:51:28,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-10-19 18:51:28,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:28,687 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-19 18:51:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-10-19 18:51:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2020-10-19 18:51:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 18:51:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-10-19 18:51:28,692 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-19 18:51:28,692 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-19 18:51:28,692 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:51:28,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-10-19 18:51:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:28,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:28,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:28,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:28,694 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:28,694 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 440#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 441#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 442#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 448#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 449#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 450#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 451#L36-3 assume !(main_~i~0 < main_~n~0); 431#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 436#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 438#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 443#L14-3 [2020-10-19 18:51:28,694 INFO L796 eck$LassoCheckResult]: Loop: 443#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 430#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 432#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 443#L14-3 [2020-10-19 18:51:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2020-10-19 18:51:28,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:28,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338461012] [2020-10-19 18:51:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2020-10-19 18:51:28,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:28,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206350936] [2020-10-19 18:51:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,728 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2020-10-19 18:51:28,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:28,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376689041] [2020-10-19 18:51:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:28,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:28,810 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:29,062 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-10-19 18:51:29,356 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-19 18:51:29,428 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:29,428 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:29,428 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:29,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:29,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:29,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:29,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:29,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:29,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2020-10-19 18:51:29,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:29,430 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:29,434 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-19 18:51:29,439 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-19 18:51:29,441 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-19 18:51:29,444 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-19 18:51:29,447 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-19 18:51:29,449 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-19 18:51:29,451 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-19 18:51:29,453 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-19 18:51:29,455 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-19 18:51:29,585 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-19 18:51:29,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-19 18:51:29,670 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-19 18:51:29,674 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-19 18:51:29,676 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-19 18:51:29,680 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-19 18:51:29,682 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-19 18:51:29,685 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-19 18:51:29,692 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-19 18:51:29,698 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-19 18:51:29,700 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-19 18:51:29,702 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-19 18:51:29,705 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-19 18:51:30,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:30,086 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,090 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-19 18:51:30,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,095 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,117 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-19 18:51:30,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,120 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,144 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-19 18:51:30,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,148 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,174 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-19 18:51:30,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:30,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:30,181 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,202 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-19 18:51:30,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,209 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,231 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-19 18:51:30,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,234 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,257 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-19 18:51:30,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:30,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:30,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:30,260 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,282 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-19 18:51:30,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:30,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:30,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:30,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:30,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:30,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:30,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:30,358 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-10-19 18:51:30,358 INFO L444 ModelExtractionUtils]: 15 out of 34 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:30,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:30,364 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:51:30,364 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:30,364 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2020-10-19 18:51:30,394 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-19 18:51:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:30,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:30,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:30,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:51:30,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:30,449 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-19 18:51:30,450 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-19 18:51:30,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-19 18:51:30,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2020-10-19 18:51:30,481 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-19 18:51:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:51:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-19 18:51:30,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-10-19 18:51:30,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:30,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:51:30,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:30,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-19 18:51:30,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:30,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2020-10-19 18:51:30,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:30,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2020-10-19 18:51:30,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:51:30,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:51:30,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2020-10-19 18:51:30,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:30,487 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-19 18:51:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2020-10-19 18:51:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2020-10-19 18:51:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 18:51:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-19 18:51:30,489 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 18:51:30,489 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-19 18:51:30,489 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:51:30,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-19 18:51:30,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:30,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:30,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:30,491 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:30,491 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:30,491 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 585#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 586#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 587#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 593#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 594#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 595#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 596#L36-3 assume !(main_~i~0 < main_~n~0); 579#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 581#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 582#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 589#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 578#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 580#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 592#L14-3 assume !(~index~0 < ~size); 590#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 576#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 583#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 584#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 588#L14-3 [2020-10-19 18:51:30,491 INFO L796 eck$LassoCheckResult]: Loop: 588#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 575#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 577#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 588#L14-3 [2020-10-19 18:51:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2020-10-19 18:51:30,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:30,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147276238] [2020-10-19 18:51:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:30,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147276238] [2020-10-19 18:51:30,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316274388] [2020-10-19 18:51:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:30,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 18:51:30,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:51:30,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:30,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-10-19 18:51:30,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085152132] [2020-10-19 18:51:30,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2020-10-19 18:51:30,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:30,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558844155] [2020-10-19 18:51:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:30,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:30,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:30,725 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:30,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:30,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-19 18:51:30,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-19 18:51:30,779 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2020-10-19 18:51:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:30,951 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-10-19 18:51:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 18:51:30,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2020-10-19 18:51:30,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:30,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2020-10-19 18:51:30,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-19 18:51:30,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:51:30,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2020-10-19 18:51:30,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:30,955 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-10-19 18:51:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2020-10-19 18:51:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-19 18:51:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 18:51:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-19 18:51:30,959 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-19 18:51:30,959 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-19 18:51:30,959 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:51:30,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2020-10-19 18:51:30,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:30,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:30,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:30,961 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:30,961 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:30,962 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 722#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 723#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 724#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 730#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 731#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 732#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 735#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 734#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 733#L36-3 assume !(main_~i~0 < main_~n~0); 716#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 718#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 719#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 726#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 715#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 717#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 729#L14-3 assume !(~index~0 < ~size); 727#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 713#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 720#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 721#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 725#L14-3 [2020-10-19 18:51:30,962 INFO L796 eck$LassoCheckResult]: Loop: 725#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 712#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 714#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 725#L14-3 [2020-10-19 18:51:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2046843302, now seen corresponding path program 2 times [2020-10-19 18:51:30,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:30,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493565358] [2020-10-19 18:51:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:31,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493565358] [2020-10-19 18:51:31,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306106193] [2020-10-19 18:51:31,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:31,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:51:31,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:31,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 18:51:31,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:31,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:31,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-19 18:51:31,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654347092] [2020-10-19 18:51:31,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2020-10-19 18:51:31,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:31,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516448246] [2020-10-19 18:51:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,254 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:31,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-19 18:51:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-10-19 18:51:31,304 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand 17 states. [2020-10-19 18:51:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:31,600 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-10-19 18:51:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 18:51:31,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2020-10-19 18:51:31,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:31,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2020-10-19 18:51:31,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:51:31,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:51:31,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2020-10-19 18:51:31,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:31,606 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-10-19 18:51:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2020-10-19 18:51:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2020-10-19 18:51:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-19 18:51:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-10-19 18:51:31,611 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-10-19 18:51:31,611 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-10-19 18:51:31,611 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:51:31,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2020-10-19 18:51:31,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:31,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:31,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:31,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:31,613 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:31,614 INFO L794 eck$LassoCheckResult]: Stem: 880#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 874#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 875#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 876#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 882#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 883#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 884#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 887#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 886#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 885#L36-3 assume !(main_~i~0 < main_~n~0); 868#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 869#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 870#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 890#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 889#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 881#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 878#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 866#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 867#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 888#L14-3 assume !(~index~0 < ~size); 879#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 864#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 871#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 872#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 877#L14-3 [2020-10-19 18:51:31,614 INFO L796 eck$LassoCheckResult]: Loop: 877#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 863#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 865#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 877#L14-3 [2020-10-19 18:51:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:31,614 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 3 times [2020-10-19 18:51:31,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:31,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379124702] [2020-10-19 18:51:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 4 times [2020-10-19 18:51:31,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:31,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66781516] [2020-10-19 18:51:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,727 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2020-10-19 18:51:31,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:31,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193663355] [2020-10-19 18:51:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:31,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:31,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:32,175 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2020-10-19 18:51:32,500 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-19 18:51:32,809 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2020-10-19 18:51:33,303 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2020-10-19 18:51:33,435 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-19 18:51:33,438 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:33,439 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:33,439 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:33,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:33,439 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:33,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:33,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:33,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:33,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration9_Lasso [2020-10-19 18:51:33,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:33,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:33,442 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-19 18:51:33,445 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-19 18:51:33,447 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-19 18:51:33,455 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-19 18:51:33,457 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-19 18:51:33,459 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-19 18:51:33,462 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-19 18:51:33,721 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-10-19 18:51:33,833 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-19 18:51:33,836 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-19 18:51:33,838 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-19 18:51:33,840 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-19 18:51:33,842 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-19 18:51:33,845 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-19 18:51:33,847 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-19 18:51:33,848 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-19 18:51:33,851 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-19 18:51:33,854 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-19 18:51:33,856 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-19 18:51:33,858 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-19 18:51:33,861 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-19 18:51:33,863 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-19 18:51:33,865 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-19 18:51:33,868 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-19 18:51:33,869 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-19 18:51:34,340 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:34,341 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:34,350 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-19 18:51:34,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:34,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:34,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,355 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,381 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-19 18:51:34,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:34,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:34,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:34,385 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,407 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-19 18:51:34,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:34,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:34,414 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,447 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-19 18:51:34,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:34,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:34,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:34,451 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,474 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-19 18:51:34,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:34,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:34,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:34,477 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:34,500 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:34,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:34,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:34,503 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,526 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-19 18:51:34,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:34,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:34,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:34,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:34,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:34,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:34,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:34,585 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-19 18:51:34,585 INFO L444 ModelExtractionUtils]: 6 out of 34 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:34,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:34,589 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:51:34,589 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:34,590 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~minIndex~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~minIndex~0 - 1*selectionSort_~array.offset + 2*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [-1*selectionSort_~minIndex~0 + 1*selectionSort_~index~0 - 1 >= 0] [2020-10-19 18:51:34,677 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2020-10-19 18:51:34,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:51:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:34,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:34,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:34,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:34,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:34,807 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-19 18:51:34,808 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-19 18:51:34,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:51:34,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 53 transitions. Complement of second has 9 states. [2020-10-19 18:51:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-19 18:51:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-10-19 18:51:34,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 18:51:34,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:34,928 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:51:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:34,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:34,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,079 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-19 18:51:35,080 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 18:51:35,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:51:35,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 48 states and 61 transitions. Complement of second has 10 states. [2020-10-19 18:51:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-10-19 18:51:35,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 18:51:35,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:35,180 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:51:35,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,309 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-19 18:51:35,309 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 18:51:35,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:51:35,420 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 55 states and 67 transitions. Complement of second has 8 states. [2020-10-19 18:51:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-19 18:51:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-10-19 18:51:35,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 18:51:35,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:35,425 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:51:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:35,557 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-19 18:51:35,557 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 18:51:35,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:51:35,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 64 transitions. Complement of second has 9 states. [2020-10-19 18:51:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-19 18:51:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:51:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-10-19 18:51:35,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 24 letters. Loop has 3 letters. [2020-10-19 18:51:35,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:35,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-19 18:51:35,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:35,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 24 letters. Loop has 6 letters. [2020-10-19 18:51:35,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:35,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2020-10-19 18:51:35,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:35,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 57 transitions. [2020-10-19 18:51:35,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:51:35,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-19 18:51:35,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2020-10-19 18:51:35,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:35,659 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-19 18:51:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2020-10-19 18:51:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-10-19 18:51:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-19 18:51:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2020-10-19 18:51:35,664 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-19 18:51:35,664 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-19 18:51:35,664 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:51:35,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-10-19 18:51:35,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:35,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:35,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:35,666 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:35,666 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:35,667 INFO L794 eck$LassoCheckResult]: Stem: 1600#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1591#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 1592#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 1593#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1603#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1604#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1605#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1610#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1609#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1608#L36-3 assume !(main_~i~0 < main_~n~0); 1584#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 1586#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1587#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1595#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1596#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 1621#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1598#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1618#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 1616#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1617#L14-3 assume !(~index~0 < ~size); 1599#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1581#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 1588#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1589#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1597#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1580#L16 [2020-10-19 18:51:35,667 INFO L796 eck$LassoCheckResult]: Loop: 1580#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 1582#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1594#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1580#L16 [2020-10-19 18:51:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1937503282, now seen corresponding path program 3 times [2020-10-19 18:51:35,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:35,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983264958] [2020-10-19 18:51:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:35,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:35,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:35,705 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash 72547, now seen corresponding path program 1 times [2020-10-19 18:51:35,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:35,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962682136] [2020-10-19 18:51:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:35,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:35,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:35,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash -94740362, now seen corresponding path program 2 times [2020-10-19 18:51:35,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:35,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742303467] [2020-10-19 18:51:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 18:51:35,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742303467] [2020-10-19 18:51:35,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694529487] [2020-10-19 18:51:35,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:35,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:51:35,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:35,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 18:51:35,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-19 18:51:36,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:36,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-10-19 18:51:36,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877972786] [2020-10-19 18:51:36,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-19 18:51:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2020-10-19 18:51:36,270 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. cyclomatic complexity: 16 Second operand 24 states. [2020-10-19 18:51:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:36,755 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2020-10-19 18:51:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-19 18:51:36,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 109 transitions. [2020-10-19 18:51:36,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:36,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 45 states and 57 transitions. [2020-10-19 18:51:36,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:51:36,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:51:36,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2020-10-19 18:51:36,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:36,763 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-19 18:51:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2020-10-19 18:51:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2020-10-19 18:51:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-19 18:51:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-10-19 18:51:36,769 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-10-19 18:51:36,769 INFO L594 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-10-19 18:51:36,769 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:51:36,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2020-10-19 18:51:36,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:36,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:36,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:36,775 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:36,775 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:36,775 INFO L794 eck$LassoCheckResult]: Stem: 1854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1846#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 1847#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 1848#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1856#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1857#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1858#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1870#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1869#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1868#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 1867#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 1866#L36-3 assume !(main_~i~0 < main_~n~0); 1838#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 1841#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1842#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1850#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1852#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 1877#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1876#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1863#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 1871#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1862#L14-3 assume !(~index~0 < ~size); 1853#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1835#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 1843#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 1844#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 1849#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1834#L16 [2020-10-19 18:51:36,776 INFO L796 eck$LassoCheckResult]: Loop: 1834#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 1836#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 1851#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 1834#L16 [2020-10-19 18:51:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash -938443152, now seen corresponding path program 4 times [2020-10-19 18:51:36,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:36,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795677437] [2020-10-19 18:51:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:36,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795677437] [2020-10-19 18:51:36,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411204023] [2020-10-19 18:51:36,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:51:36,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 18:51:36,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:51:36,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 18:51:36,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:51:37,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:51:37,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-10-19 18:51:37,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696449329] [2020-10-19 18:51:37,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:51:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash 72547, now seen corresponding path program 2 times [2020-10-19 18:51:37,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:37,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960804390] [2020-10-19 18:51:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:37,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:51:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-19 18:51:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-19 18:51:37,195 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand 21 states. [2020-10-19 18:51:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:51:37,477 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2020-10-19 18:51:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-19 18:51:37,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 90 transitions. [2020-10-19 18:51:37,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:37,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 90 transitions. [2020-10-19 18:51:37,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:51:37,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:51:37,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2020-10-19 18:51:37,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:51:37,481 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-19 18:51:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2020-10-19 18:51:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2020-10-19 18:51:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-19 18:51:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-10-19 18:51:37,486 INFO L714 BuchiCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-10-19 18:51:37,486 INFO L594 BuchiCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-10-19 18:51:37,486 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 18:51:37,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 66 transitions. [2020-10-19 18:51:37,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:51:37,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:51:37,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:51:37,489 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:51:37,489 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:51:37,489 INFO L794 eck$LassoCheckResult]: Stem: 2081#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2073#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 2074#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 2075#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 2084#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 2085#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 2086#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 2096#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 2095#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 2094#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 2093#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 2092#L36-3 assume !(main_~i~0 < main_~n~0); 2066#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 2068#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 2069#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 2077#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2065#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 2067#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 2107#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2106#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 2105#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 2103#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2098#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 2102#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 2097#L14-3 assume !(~index~0 < ~size); 2080#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2063#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 2070#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 2071#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 2079#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2062#L16 [2020-10-19 18:51:37,489 INFO L796 eck$LassoCheckResult]: Loop: 2062#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 2064#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 2076#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 2062#L16 [2020-10-19 18:51:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1497938134, now seen corresponding path program 5 times [2020-10-19 18:51:37,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:37,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842216480] [2020-10-19 18:51:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 72547, now seen corresponding path program 3 times [2020-10-19 18:51:37,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:37,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490531983] [2020-10-19 18:51:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,547 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -364701798, now seen corresponding path program 6 times [2020-10-19 18:51:37,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:51:37,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827422439] [2020-10-19 18:51:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:51:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:51:37,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:51:37,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:51:38,016 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-10-19 18:51:38,412 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2020-10-19 18:51:38,929 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 100 [2020-10-19 18:51:39,670 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 132 [2020-10-19 18:51:39,813 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-19 18:51:39,816 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:51:39,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:51:39,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:51:39,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:51:39,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:51:39,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:39,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:51:39,817 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:51:39,818 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration12_Lasso [2020-10-19 18:51:39,818 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:51:39,818 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:51:39,821 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-19 18:51:39,830 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-19 18:51:39,833 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-19 18:51:39,835 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-19 18:51:39,838 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-19 18:51:39,843 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-19 18:51:39,845 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-19 18:51:39,847 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-19 18:51:39,849 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-19 18:51:39,851 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-19 18:51:39,854 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-19 18:51:39,856 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-19 18:51:39,862 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-19 18:51:39,864 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-19 18:51:39,866 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-19 18:51:39,868 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-19 18:51:39,870 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-19 18:51:39,873 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-19 18:51:39,875 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-19 18:51:39,878 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-19 18:51:39,880 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-19 18:51:39,882 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-19 18:51:40,258 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2020-10-19 18:51:40,418 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2020-10-19 18:51:40,994 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:51:40,994 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,003 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-19 18:51:41,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,006 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,029 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-19 18:51:41,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,032 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,055 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-19 18:51:41,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,058 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,080 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-19 18:51:41,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:41,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:41,085 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:41,107 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,117 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:41,154 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-19 18:51:41,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,159 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:41,195 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-19 18:51:41,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,206 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:41,230 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-19 18:51:41,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,236 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,258 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-19 18:51:41,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:41,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:41,264 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,287 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-19 18:51:41,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,290 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,312 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-19 18:51:41,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,315 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,337 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-19 18:51:41,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,340 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,362 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-19 18:51:41,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,372 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:51:41,404 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-19 18:51:41,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,408 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,429 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-19 18:51:41,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,432 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,454 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-19 18:51:41,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,457 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,480 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-19 18:51:41,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,483 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,506 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-19 18:51:41,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,509 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,532 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-19 18:51:41,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:51:41,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:51:41,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:51:41,535 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,557 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-19 18:51:41,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:41,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:41,564 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,586 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-19 18:51:41,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,587 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 18:51:41,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,591 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-19 18:51:41,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:41,599 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,619 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-19 18:51:41,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:51:41,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:51:41,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:51:41,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:51:41,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:51:41,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:51:41,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:51:41,678 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 18:51:41,678 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:51:41,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:51:41,688 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:51:41,689 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:51:41,689 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length selectionSort_#in~array.base)_4, selectionSort_~index~0, selectionSort_~array.offset) = 1*v_rep(select #length selectionSort_#in~array.base)_4 - 4*selectionSort_~index~0 - 1*selectionSort_~array.offset Supporting invariants [] [2020-10-19 18:51:41,834 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2020-10-19 18:51:41,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:51:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:41,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:41,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:51:41,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:41,946 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-19 18:51:41,947 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-19 18:51:41,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-10-19 18:51:42,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 102 transitions. Complement of second has 9 states. [2020-10-19 18:51:42,013 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-19 18:51:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:51:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-10-19 18:51:42,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 18:51:42,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:42,015 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:51:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:42,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:42,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:42,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:51:42,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:42,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-19 18:51:42,122 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-19 18:51:42,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-10-19 18:51:42,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 102 transitions. Complement of second has 9 states. [2020-10-19 18:51:42,176 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-19 18:51:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:51:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-10-19 18:51:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 18:51:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:42,177 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:51:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:51:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:42,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 18:51:42,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:51:42,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:51:42,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:51:42,269 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-19 18:51:42,269 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-19 18:51:42,270 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18 Second operand 5 states. [2020-10-19 18:51:42,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 66 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 96 states and 119 transitions. Complement of second has 15 states. [2020-10-19 18:51:42,339 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-19 18:51:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:51:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-19 18:51:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 18:51:42,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 33 letters. Loop has 3 letters. [2020-10-19 18:51:42,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 30 letters. Loop has 6 letters. [2020-10-19 18:51:42,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:51:42,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 119 transitions. [2020-10-19 18:51:42,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:51:42,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 0 states and 0 transitions. [2020-10-19 18:51:42,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:51:42,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:51:42,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:51:42,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:51:42,345 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:51:42,345 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:51:42,345 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:51:42,345 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 18:51:42,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:51:42,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:51:42,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:51:42,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:51:42 BoogieIcfgContainer [2020-10-19 18:51:42,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:51:42,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:51:42,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:51:42,352 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:51:42,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:51:22" (3/4) ... [2020-10-19 18:51:42,357 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:51:42,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:51:42,358 INFO L168 Benchmark]: Toolchain (without parser) took 20326.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 955.9 MB in the beginning and 831.5 MB in the end (delta: 124.4 MB). Peak memory consumption was 502.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,359 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:51:42,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.97 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,360 INFO L168 Benchmark]: Boogie Preprocessor took 37.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,361 INFO L168 Benchmark]: RCFGBuilder took 336.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,361 INFO L168 Benchmark]: BuchiAutomizer took 19552.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 831.5 MB in the end (delta: 283.7 MB). Peak memory consumption was 516.5 MB. Max. memory is 11.5 GB. [2020-10-19 18:51:42,361 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 1.4 GB. Free memory is still 831.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:51:42,363 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.97 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 336.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19552.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 831.5 MB in the end (delta: 283.7 MB). Peak memory consumption was 516.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.15 ms. Allocated memory is still 1.4 GB. Free memory is still 831.5 MB. There was no memory consumed. Max. memory is 11.5 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 - 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 12 terminating modules (7 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * i + -1 * a and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(startIndex) + \old(size) and consists of 4 locations. One deterministic module has affine ranking function -1 * index + size and consists of 4 locations. One nondeterministic module has affine ranking function -4 * minIndex + -1 * array + 2 * unknown-#length-unknown[array] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[array] + -4 * index + -1 * array and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 15.9s. Construction of modules took 0.8s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 11. Nontrivial modules had stage [3, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 197 SDtfs, 390 SDslu, 360 SDs, 0 SdLazy, 895 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax100 hnf98 lsp96 ukn70 mio100 lsp60 div100 bol100 ite100 ukn100 eq162 hnf85 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...