./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 30f4e4ab 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.24-30f4e4a [2019-11-28 03:04:57,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:04:57,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:04:57,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:04:57,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:04:57,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:04:57,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:04:57,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:04:57,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:04:57,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:04:57,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:04:57,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:04:57,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:04:57,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:04:57,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:04:57,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:04:57,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:04:57,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:04:57,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:04:57,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:04:57,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:04:57,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:04:57,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:04:57,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:04:57,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:04:57,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:04:57,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:04:57,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:04:57,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:04:57,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:04:57,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:04:57,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:04:57,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:04:57,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:04:57,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:04:57,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:04:57,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:04:57,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:04:57,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:04:57,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:04:57,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:04:57,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:04:57,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:04:57,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:04:57,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:04:57,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:04:57,951 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:04:57,951 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:04:57,951 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:04:57,952 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:04:57,952 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:04:57,952 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:04:57,952 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:04:57,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:04:57,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:04:57,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:04:57,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:04:57,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:04:57,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:04:57,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:04:57,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:04:57,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:04:57,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:04:57,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:04:57,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:04:57,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:04:57,957 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:04:57,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:04:57,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:04:57,958 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:04:57,959 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:04:57,960 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 [2019-11-28 03:04:58,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:04:58,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:04:58,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:04:58,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:04:58,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:04:58,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-28 03:04:58,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e154d36/1b191a6c80f64813856a95b9ae5e42c8/FLAG760b286ac [2019-11-28 03:04:58,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:04:58,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-28 03:04:58,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e154d36/1b191a6c80f64813856a95b9ae5e42c8/FLAG760b286ac [2019-11-28 03:04:59,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e154d36/1b191a6c80f64813856a95b9ae5e42c8 [2019-11-28 03:04:59,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:04:59,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:04:59,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:59,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:04:59,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:04:59,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f492a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59, skipping insertion in model container [2019-11-28 03:04:59,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:04:59,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:04:59,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:59,447 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:04:59,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:59,481 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:04:59,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59 WrapperNode [2019-11-28 03:04:59,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:59,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:59,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:04:59,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:04:59,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:59,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:04:59,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:04:59,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:04:59,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (1/1) ... [2019-11-28 03:04:59,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:04:59,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:04:59,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:04:59,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:04:59,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (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 [2019-11-28 03:04:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:04:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:04:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:04:59,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:04:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:04:59,662 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2019-11-28 03:04:59,662 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2019-11-28 03:04:59,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:04:59,930 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:04:59,934 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:04:59,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:59 BoogieIcfgContainer [2019-11-28 03:04:59,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:04:59,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:04:59,942 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:04:59,950 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:04:59,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:59,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:04:59" (1/3) ... [2019-11-28 03:04:59,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@534e473c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:59, skipping insertion in model container [2019-11-28 03:04:59,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:59,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:59" (2/3) ... [2019-11-28 03:04:59,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@534e473c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:59, skipping insertion in model container [2019-11-28 03:04:59,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:59,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:59" (3/3) ... [2019-11-28 03:04:59,954 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2019-11-28 03:05:00,000 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:05:00,000 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:05:00,000 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:05:00,000 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:05:00,000 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:05:00,001 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:05:00,001 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:05:00,001 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:05:00,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-28 03:05:00,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:05:00,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:00,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:00,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:05:00,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:00,044 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:05:00,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-28 03:05:00,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:05:00,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:00,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:00,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:05:00,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:00,054 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 [2019-11-28 03:05:00,054 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 [2019-11-28 03:05:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 03:05:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:00,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572603340] [2019-11-28 03:05:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2019-11-28 03:05:00,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:00,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141337446] [2019-11-28 03:05:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2019-11-28 03:05:00,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:00,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356433577] [2019-11-28 03:05:00,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:00,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:00,450 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:00,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:00,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:00,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:00,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:00,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:00,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:00,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:00,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2019-11-28 03:05:00,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:00,453 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:00,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:00,927 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:00,933 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) [2019-11-28 03:05:00,945 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 [2019-11-28 03:05:00,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:00,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:00,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:00,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:00,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:00,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:00,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:00,958 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 [2019-11-28 03:05:00,979 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 [2019-11-28 03:05:00,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:00,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:00,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:00,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:00,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:00,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:00,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:00,985 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) [2019-11-28 03:05:01,001 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 [2019-11-28 03:05:01,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:01,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:01,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:01,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:01,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:01,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:01,015 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) [2019-11-28 03:05:01,033 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 [2019-11-28 03:05:01,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:01,038 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:05:01,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:01,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:01,049 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:05:01,051 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 [2019-11-28 03:05:01,063 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) [2019-11-28 03:05:01,081 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 [2019-11-28 03:05:01,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:01,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:01,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:01,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:01,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:01,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:01,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-11-28 03:05:01,121 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 [2019-11-28 03:05:01,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:01,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:01,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:01,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:01,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:01,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:01,162 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:01,215 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:05:01,215 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 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) [2019-11-28 03:05:01,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:01,240 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:05:01,240 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:01,241 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~a~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~a~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~n~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 >= 0] [2019-11-28 03:05:01,268 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:05:01,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:05:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:01,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:05:01,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:01,388 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:05:01,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:01,437 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 [2019-11-28 03:05:01,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2019-11-28 03:05:01,541 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2019-11-28 03:05:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:05:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-11-28 03:05:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 03:05:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:05:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 03:05:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:01,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-28 03:05:01,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:05:01,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2019-11-28 03:05:01,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:05:01,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:05:01,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 03:05:01,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:01,583 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 03:05:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 03:05:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 03:05:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:05:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 03:05:01,615 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 03:05:01,615 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 03:05:01,615 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:05:01,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-28 03:05:01,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:05:01,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:01,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:01,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:01,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:01,618 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 129#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; 130#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; 131#L36-3 assume !(main_~i~0 < main_~n~0); 124#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 127#selectionSortENTRY [2019-11-28 03:05:01,618 INFO L796 eck$LassoCheckResult]: Loop: 127#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 128#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 132#L14-3 assume !(~index~0 < ~size); 133#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); 125#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 127#selectionSortENTRY [2019-11-28 03:05:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2019-11-28 03:05:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:01,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402229642] [2019-11-28 03:05:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:01,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402229642] [2019-11-28 03:05:01,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:05:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:05:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825982492] [2019-11-28 03:05:01,701 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2019-11-28 03:05:01,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:01,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837655883] [2019-11-28 03:05:01,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837655883] [2019-11-28 03:05:01,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:05:01,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:05:01,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151241463] [2019-11-28 03:05:01,740 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:05:01,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:01,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:05:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:05:01,745 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 03:05:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:01,767 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-28 03:05:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:05:01,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-28 03:05:01,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:01,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:05:01,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:05:01,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:05:01,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 03:05:01,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:01,772 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:05:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 03:05:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:05:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:05:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:05:01,775 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:05:01,775 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:05:01,775 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:05:01,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 03:05:01,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:01,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:01,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:01,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:01,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:01,778 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#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; 166#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; 167#L36-3 assume !(main_~i~0 < main_~n~0); 160#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 163#selectionSortENTRY [2019-11-28 03:05:01,778 INFO L796 eck$LassoCheckResult]: Loop: 163#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 164#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 168#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); 159#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 162#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 171#L14-3 assume !(~index~0 < ~size); 169#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); 161#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 163#selectionSortENTRY [2019-11-28 03:05:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2019-11-28 03:05:01,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:01,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156583858] [2019-11-28 03:05:01,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:01,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156583858] [2019-11-28 03:05:01,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:05:01,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:05:01,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218485513] [2019-11-28 03:05:01,804 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2019-11-28 03:05:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362277718] [2019-11-28 03:05:01,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:01,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:02,083 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 03:05:02,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:05:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:05:02,297 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:05:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:02,309 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-28 03:05:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:05:02,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-28 03:05:02,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:02,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 03:05:02,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:05:02,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:05:02,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-28 03:05:02,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:02,313 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:05:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-28 03:05:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 03:05:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:05:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 03:05:02,316 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 03:05:02,317 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 03:05:02,317 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:05:02,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-28 03:05:02,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:02,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:02,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:02,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:02,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:02,319 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#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; 203#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; 204#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; 209#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 210#L36-3 assume !(main_~i~0 < main_~n~0); 197#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 200#selectionSortENTRY [2019-11-28 03:05:02,320 INFO L796 eck$LassoCheckResult]: Loop: 200#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 201#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 205#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); 196#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 199#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 208#L14-3 assume !(~index~0 < ~size); 206#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); 198#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 200#selectionSortENTRY [2019-11-28 03:05:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2019-11-28 03:05:02,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:02,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258998215] [2019-11-28 03:05:02,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:02,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:02,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:02,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2019-11-28 03:05:02,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:02,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705931687] [2019-11-28 03:05:02,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:02,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2019-11-28 03:05:02,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:02,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611316846] [2019-11-28 03:05:02,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:05:02,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611316846] [2019-11-28 03:05:02,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166641838] [2019-11-28 03:05:02,579 INFO L94 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 [2019-11-28 03:05:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:02,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:05:02,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:05:02,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:02,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 03:05:02,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260762453] [2019-11-28 03:05:02,909 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 03:05:03,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:05:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:05:03,083 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-28 03:05:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:03,196 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-28 03:05:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:05:03,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-28 03:05:03,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:03,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2019-11-28 03:05:03,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:05:03,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:05:03,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 03:05:03,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:03,200 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 03:05:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 03:05:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:05:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:05:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 03:05:03,206 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:05:03,206 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:05:03,207 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:05:03,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 03:05:03,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:05:03,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:03,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:03,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 03:05:03,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:03,217 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 299#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; 300#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; 301#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; 306#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 307#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; 308#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 309#L36-3 assume !(main_~i~0 < main_~n~0); 295#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 297#selectionSortENTRY [2019-11-28 03:05:03,217 INFO L796 eck$LassoCheckResult]: Loop: 297#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 298#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 302#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); 293#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 296#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 305#L14-3 assume !(~index~0 < ~size); 303#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); 294#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 297#selectionSortENTRY [2019-11-28 03:05:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2019-11-28 03:05:03,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:03,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667181510] [2019-11-28 03:05:03,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,256 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:03,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2019-11-28 03:05:03,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:03,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020456721] [2019-11-28 03:05:03,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:03,288 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2019-11-28 03:05:03,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:03,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352457652] [2019-11-28 03:05:03,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:03,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:03,526 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-28 03:05:03,900 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-11-28 03:05:04,078 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:04,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:04,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:04,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:04,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:04,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:04,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:04,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2019-11-28 03:05:04,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:04,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:04,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:04,612 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:04,612 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 [2019-11-28 03:05:04,621 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 [2019-11-28 03:05:04,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,625 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 [2019-11-28 03:05:04,632 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 [2019-11-28 03:05:04,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:04,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:04,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,657 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 [2019-11-28 03:05:04,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,662 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 [2019-11-28 03:05:04,672 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 [2019-11-28 03:05:04,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,677 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 [2019-11-28 03:05:04,683 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 [2019-11-28 03:05:04,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,686 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) [2019-11-28 03:05:04,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:05:04,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,712 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 [2019-11-28 03:05:04,717 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 [2019-11-28 03:05:04,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,723 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 [2019-11-28 03:05:04,728 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 [2019-11-28 03:05:04,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,733 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 [2019-11-28 03:05:04,740 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 [2019-11-28 03:05:04,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,745 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 [2019-11-28 03:05:04,754 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 [2019-11-28 03:05:04,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,759 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 [2019-11-28 03:05:04,766 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 [2019-11-28 03:05:04,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,774 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 [2019-11-28 03:05:04,781 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 [2019-11-28 03:05:04,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,786 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 [2019-11-28 03:05:04,793 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 [2019-11-28 03:05:04,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,798 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 [2019-11-28 03:05:04,805 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 [2019-11-28 03:05:04,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,809 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) [2019-11-28 03:05:04,816 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,822 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 [2019-11-28 03:05:04,828 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 [2019-11-28 03:05:04,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:04,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:04,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:04,842 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 [2019-11-28 03:05:04,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,854 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) [2019-11-28 03:05:04,861 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 [2019-11-28 03:05:04,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,866 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) [2019-11-28 03:05:04,874 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 [2019-11-28 03:05:04,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,880 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,896 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 [2019-11-28 03:05:04,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,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 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 [2019-11-28 03:05:04,905 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 [2019-11-28 03:05:04,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,914 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) [2019-11-28 03:05:04,931 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 [2019-11-28 03:05:04,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,937 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) [2019-11-28 03:05:04,946 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 [2019-11-28 03:05:04,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,949 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 [2019-11-28 03:05:04,950 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 [2019-11-28 03:05:04,955 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 [2019-11-28 03:05:04,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:04,959 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) [2019-11-28 03:05:04,964 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 [2019-11-28 03:05:04,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,970 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) [2019-11-28 03:05:04,983 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 [2019-11-28 03:05:04,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:04,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:04,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:04,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:04,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:04,998 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 [2019-11-28 03:05:04,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:04,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:04,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:05,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:05,003 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 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 [2019-11-28 03:05:05,009 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 [2019-11-28 03:05:05,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,011 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:05:05,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,014 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:05:05,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,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 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 [2019-11-28 03:05:05,026 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 [2019-11-28 03:05:05,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:05,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:05,130 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:05:05,130 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. 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) [2019-11-28 03:05:05,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:05:05,144 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:05,144 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 [] [2019-11-28 03:05:05,154 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 03:05:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:05,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:05:05,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:05,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:05:05,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:05:05,265 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 [2019-11-28 03:05:05,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 03:05:05,315 INFO L76 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. [2019-11-28 03:05:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:05:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 03:05:05,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-11-28 03:05:05,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:05,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-11-28 03:05:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:05,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-11-28 03:05:05,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:05,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-11-28 03:05:05,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:05:05,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2019-11-28 03:05:05,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:05:05,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:05:05,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-28 03:05:05,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:05,324 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-28 03:05:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-28 03:05:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-28 03:05:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:05:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-28 03:05:05,327 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:05:05,328 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:05:05,328 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:05:05,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-28 03:05:05,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:05:05,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:05,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:05,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:05,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:05:05,329 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#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; 450#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; 451#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; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#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; 459#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 460#L36-3 assume !(main_~i~0 < main_~n~0); 440#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 445#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 446#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 452#L14-3 [2019-11-28 03:05:05,329 INFO L796 eck$LassoCheckResult]: Loop: 452#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); 439#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 441#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 452#L14-3 [2019-11-28 03:05:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2019-11-28 03:05:05,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563991] [2019-11-28 03:05:05,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2019-11-28 03:05:05,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84539124] [2019-11-28 03:05:05,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2019-11-28 03:05:05,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666211846] [2019-11-28 03:05:05,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,676 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-11-28 03:05:05,938 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-28 03:05:06,006 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:06,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:06,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:06,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:06,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:06,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:06,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:06,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2019-11-28 03:05:06,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:06,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:06,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:06,602 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:06,603 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 03:05:06,616 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 [2019-11-28 03:05:06,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,621 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) [2019-11-28 03:05:06,628 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 [2019-11-28 03:05:06,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,633 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) [2019-11-28 03:05:06,640 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 [2019-11-28 03:05:06,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,650 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) [2019-11-28 03:05:06,658 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 [2019-11-28 03:05:06,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:06,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,666 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) [2019-11-28 03:05:06,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 [2019-11-28 03:05:06,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,679 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) [2019-11-28 03:05:06,686 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 [2019-11-28 03:05:06,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,691 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:06,699 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 [2019-11-28 03:05:06,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:06,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:06,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,714 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:06,722 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 [2019-11-28 03:05:06,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:06,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,731 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:06,738 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 [2019-11-28 03:05:06,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:06,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:06,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:06,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:06,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:06,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:06,809 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-28 03:05:06,809 INFO L444 ModelExtractionUtils]: 14 out of 34 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:05:06,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:05:06,816 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:06,816 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2019-11-28 03:05:06,825 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:05:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:05:06,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:05:06,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:06,874 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 [2019-11-28 03:05:06,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 03:05:06,903 INFO L76 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. [2019-11-28 03:05:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:05:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 03:05:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-28 03:05:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:05:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 03:05:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-11-28 03:05:06,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:05:06,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2019-11-28 03:05:06,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:05:06,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:05:06,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-28 03:05:06,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:06,909 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-28 03:05:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-28 03:05:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-11-28 03:05:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:05:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-28 03:05:06,912 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 03:05:06,912 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 03:05:06,912 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:05:06,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-28 03:05:06,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:05:06,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:06,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:06,914 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:06,914 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:05:06,915 INFO L794 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 594#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; 595#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; 596#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; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#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; 604#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 605#L36-3 assume !(main_~i~0 < main_~n~0); 589#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 598#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); 587#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 588#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 601#L14-3 assume !(~index~0 < ~size); 599#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); 585#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 592#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 593#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 597#L14-3 [2019-11-28 03:05:06,915 INFO L796 eck$LassoCheckResult]: Loop: 597#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); 584#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 586#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 597#L14-3 [2019-11-28 03:05:06,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2019-11-28 03:05:06,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:06,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471231727] [2019-11-28 03:05:06,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:05:06,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471231727] [2019-11-28 03:05:06,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943631886] [2019-11-28 03:05:06,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:07,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:05:07,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:05:07,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:07,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2019-11-28 03:05:07,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855542323] [2019-11-28 03:05:07,139 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2019-11-28 03:05:07,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174882655] [2019-11-28 03:05:07,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:05:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:05:07,220 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-28 03:05:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:07,459 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-11-28 03:05:07,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 03:05:07,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2019-11-28 03:05:07,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:05:07,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2019-11-28 03:05:07,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:05:07,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:05:07,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-28 03:05:07,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:07,463 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 03:05:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-28 03:05:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-28 03:05:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:05:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-28 03:05:07,466 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:05:07,466 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-28 03:05:07,466 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:05:07,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-28 03:05:07,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:05:07,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:07,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:07,468 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:07,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:05:07,469 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 755#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; 756#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; 757#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; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 771#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; 767#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 765#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; 766#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 768#L36-3 assume !(main_~i~0 < main_~n~0); 749#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 760#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); 770#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 763#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 759#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); 748#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 750#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 769#L14-3 assume !(~index~0 < ~size); 761#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); 746#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 753#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 754#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 [2019-11-28 03:05:07,469 INFO L796 eck$LassoCheckResult]: Loop: 758#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); 745#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 747#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 758#L14-3 [2019-11-28 03:05:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2019-11-28 03:05:07,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057898551] [2019-11-28 03:05:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2019-11-28 03:05:07,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872398033] [2019-11-28 03:05:07,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2019-11-28 03:05:07,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329473375] [2019-11-28 03:05:07,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,952 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-28 03:05:08,271 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-11-28 03:05:08,611 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-11-28 03:05:09,132 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2019-11-28 03:05:09,258 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 03:05:09,262 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:09,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:09,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:09,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:09,262 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:09,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:09,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:09,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:09,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2019-11-28 03:05:09,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:09,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:09,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,514 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-11-28 03:05:09,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:09,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:10,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:10,095 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 03:05:10,108 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 [2019-11-28 03:05:10,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:10,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:10,114 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 [2019-11-28 03:05:10,120 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 [2019-11-28 03:05:10,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:10,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:10,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:10,124 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 [2019-11-28 03:05:10,128 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 [2019-11-28 03:05:10,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:10,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:10,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:10,131 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) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:10,136 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 [2019-11-28 03:05:10,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:10,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:10,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:10,139 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 [2019-11-28 03:05:10,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 [2019-11-28 03:05:10,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:10,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:10,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:10,147 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 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 [2019-11-28 03:05:10,153 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 [2019-11-28 03:05:10,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:10,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:10,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:10,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:10,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:10,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:10,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:10,215 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:05:10,216 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:10,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:05:10,222 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:05:10,222 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:10,222 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_#in~array.base)_3) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_#in~array.base)_3 Supporting invariants [] [2019-11-28 03:05:10,291 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2019-11-28 03:05:10,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:05:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:10,387 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 [2019-11-28 03:05:10,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:05:10,439 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 55 transitions. Complement of second has 9 states. [2019-11-28 03:05:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:05:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-28 03:05:10,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 03:05:10,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:10,443 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:05:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:10,525 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 [2019-11-28 03:05:10,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:05:10,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 55 transitions. Complement of second has 9 states. [2019-11-28 03:05:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:05:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-28 03:05:10,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 03:05:10,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:10,572 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:05:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:10,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:05:10,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:10,660 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 [2019-11-28 03:05:10,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:05:10,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 15 states. [2019-11-28 03:05:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:05:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 03:05:10,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-28 03:05:10,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:10,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-28 03:05:10,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:10,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-28 03:05:10,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:10,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2019-11-28 03:05:10,729 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:10,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2019-11-28 03:05:10,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:05:10,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:05:10,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:05:10,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:10,730 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:10,730 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:10,730 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:10,730 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:05:10,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:05:10,731 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:10,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:05:10,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:05:10 BoogieIcfgContainer [2019-11-28 03:05:10,737 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:05:10,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:05:10,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:05:10,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:05:10,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:59" (3/4) ... [2019-11-28 03:05:10,743 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:05:10,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:05:10,744 INFO L168 Benchmark]: Toolchain (without parser) took 11545.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 956.3 MB in the beginning and 890.6 MB in the end (delta: 65.8 MB). Peak memory consumption was 390.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,745 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:10,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,746 INFO L168 Benchmark]: Boogie Preprocessor took 24.94 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,747 INFO L168 Benchmark]: RCFGBuilder took 347.33 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.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,747 INFO L168 Benchmark]: BuchiAutomizer took 10795.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 890.6 MB in the end (delta: 230.5 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:10,748 INFO L168 Benchmark]: Witness Printer took 5.14 ms. Allocated memory is still 1.4 GB. Free memory is still 890.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:10,750 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 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 86.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.94 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.33 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.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10795.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 890.6 MB in the end (delta: 230.5 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.14 ms. Allocated memory is still 1.4 GB. Free memory is still 890.6 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[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 * index + -1 * array + unknown-#length-unknown[array] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 9.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 113 SDtfs, 144 SDslu, 132 SDs, 0 SdLazy, 258 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf99 lsp96 ukn71 mio100 lsp63 div100 bol100 ite100 ukn100 eq163 hnf89 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms 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...