./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 32bit --witnessprinter.graph.data.programhash 65401fe061f89bb729dffabf74050dfab9fe7d77 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:41,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:41,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:41,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:41,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:41,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:41,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:41,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:41,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:41,816 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:41,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:41,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:41,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:41,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:41,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:41,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:41,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:41,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:41,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:41,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:41,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:41,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:41,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:41,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:41,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:41,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:41,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:41,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:41,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:41,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:41,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:41,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:41,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:41,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:41,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:41,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:41,845 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:41,862 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:41,862 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:41,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:41,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:41,863 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:41,864 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:41,864 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:41,864 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:41,864 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:41,864 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:41,865 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:41,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:41,866 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:41,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:41,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:41,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:41,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:41,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:41,868 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:41,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:41,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:41,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:41,869 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:41,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:41,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:41,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:41,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:41,872 INFO L133 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2019-01-02 00:19:41,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:41,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:41,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:41,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:41,955 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:41,956 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:42,026 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fa3ccb4/9e59e96ea690473ebff5cdce4ad477f0/FLAG5299255d4 [2019-01-02 00:19:42,578 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:42,580 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:42,595 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fa3ccb4/9e59e96ea690473ebff5cdce4ad477f0/FLAG5299255d4 [2019-01-02 00:19:42,854 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fa3ccb4/9e59e96ea690473ebff5cdce4ad477f0 [2019-01-02 00:19:42,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:42,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:42,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:42,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:42,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:42,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:42" (1/1) ... [2019-01-02 00:19:42,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c789206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:42, skipping insertion in model container [2019-01-02 00:19:42,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:42" (1/1) ... [2019-01-02 00:19:42,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:42,934 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:43,279 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:43,298 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:43,378 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:43,436 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:43,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43 WrapperNode [2019-01-02 00:19:43,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:43,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:43,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:43,437 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:43,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:43,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:43,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:43,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:43,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (1/1) ... [2019-01-02 00:19:43,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:43,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:43,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:43,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:43,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (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-01-02 00:19:43,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:43,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:43,995 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:43,996 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:19:43,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:43 BoogieIcfgContainer [2019-01-02 00:19:43,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:43,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:43,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:44,002 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:44,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:44,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:42" (1/3) ... [2019-01-02 00:19:44,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49255e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:44, skipping insertion in model container [2019-01-02 00:19:44,004 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:44,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:43" (2/3) ... [2019-01-02 00:19:44,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49255e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:44, skipping insertion in model container [2019-01-02 00:19:44,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:44,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:43" (3/3) ... [2019-01-02 00:19:44,007 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:44,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:44,070 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:44,070 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:44,070 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:44,071 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:44,071 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:44,071 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:44,071 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:44,071 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:44,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:19:44,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:19:44,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:44,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:44,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:19:44,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:44,124 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:44,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:19:44,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:19:44,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:44,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:44,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:19:44,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:44,134 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 10#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L551-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 11#L543-3true [2019-01-02 00:19:44,134 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 8#L544-3true assume !true; 9#L543-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 11#L543-3true [2019-01-02 00:19:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-02 00:19:44,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-01-02 00:19:44,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:44,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:44,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:44,309 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:44,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:19:44,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:19:44,329 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-02 00:19:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:44,337 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-02 00:19:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:19:44,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-02 00:19:44,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:19:44,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-01-02 00:19:44,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:19:44,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-02 00:19:44,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-02 00:19:44,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:44,348 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-02 00:19:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-02 00:19:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-02 00:19:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-02 00:19:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-02 00:19:44,380 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-02 00:19:44,380 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-02 00:19:44,380 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:44,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-01-02 00:19:44,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:19:44,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:44,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:44,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:19:44,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:44,385 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 41#L543-3 [2019-01-02 00:19:44,386 INFO L796 eck$LassoCheckResult]: Loop: 41#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 37#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 39#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 41#L543-3 [2019-01-02 00:19:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,386 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-02 00:19:44,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:44,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-01-02 00:19:44,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:44,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:44,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:44,475 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:44,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:19:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:19:44,476 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-02 00:19:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:44,544 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-02 00:19:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:19:44,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-02 00:19:44,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:19:44,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-01-02 00:19:44,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:44,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:44,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-02 00:19:44,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:44,547 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:19:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-02 00:19:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-02 00:19:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-02 00:19:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-02 00:19:44,549 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:19:44,549 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:19:44,549 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:44,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-02 00:19:44,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-02 00:19:44,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:44,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:44,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:19:44,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:44,551 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 68#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 67#L543-3 [2019-01-02 00:19:44,551 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 64#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 65#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 61#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 62#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 66#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 67#L543-3 [2019-01-02 00:19:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,552 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-01-02 00:19:44,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-01-02 00:19:44,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:44,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-01-02 00:19:44,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:44,988 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-02 00:19:45,495 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-02 00:19:45,663 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-02 00:19:45,676 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:45,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:45,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:45,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:45,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:45,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:45,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:45,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:45,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:19:45,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:45,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:45,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,236 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-02 00:19:46,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:46,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:46,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:46,865 INFO L122 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-01-02 00:19:46,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:46,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:46,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:46,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,880 INFO L122 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-01-02 00:19:46,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:46,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:46,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:46,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,885 INFO L122 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-01-02 00:19:46,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:46,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:46,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:46,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,890 INFO L122 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-01-02 00:19:46,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:46,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:46,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,901 INFO L122 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-01-02 00:19:46,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:46,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:46,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:46,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,906 INFO L122 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-01-02 00:19:46,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:46,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:46,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:46,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,917 INFO L122 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-01-02 00:19:46,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:46,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,925 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:46,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:46,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,947 INFO L122 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-01-02 00:19:46,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:46,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:46,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:46,957 INFO L122 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-01-02 00:19:46,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:46,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:46,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:46,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:46,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:46,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:47,087 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:47,164 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:19:47,164 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-02 00:19:47,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:47,170 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:47,171 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:47,171 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-02 00:19:47,289 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:19:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:47,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:47,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:19:47,442 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-01-02 00:19:47,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-02 00:19:47,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2019-01-02 00:19:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-02 00:19:47,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-02 00:19:47,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:47,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-02 00:19:47,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:47,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-02 00:19:47,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:47,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-02 00:19:47,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:47,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-01-02 00:19:47,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-02 00:19:47,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-02 00:19:47,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-01-02 00:19:47,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:47,519 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-02 00:19:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-01-02 00:19:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-02 00:19:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-02 00:19:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-02 00:19:47,521 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-02 00:19:47,522 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-02 00:19:47,522 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:19:47,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-02 00:19:47,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:47,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:47,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:47,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:47,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:47,524 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 163#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 164#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 154#L544-3 [2019-01-02 00:19:47,524 INFO L796 eck$LassoCheckResult]: Loop: 154#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 158#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 153#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 154#L544-3 [2019-01-02 00:19:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-02 00:19:47,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-02 00:19:47,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:47,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:47,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:47,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-02 00:19:47,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:47,824 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-02 00:19:48,296 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-02 00:19:48,363 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:48,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:48,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:48,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:48,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:48,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:48,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:48,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:48,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:19:48,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:48,365 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:48,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:48,538 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-02 00:19:49,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:49,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:49,088 INFO L122 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-01-02 00:19:49,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,095 INFO L122 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-01-02 00:19:49,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,102 INFO L122 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-01-02 00:19:49,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:49,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,109 INFO L122 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-01-02 00:19:49,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,115 INFO L122 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-01-02 00:19:49,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,120 INFO L122 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-01-02 00:19:49,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:49,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,128 INFO L122 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-01-02 00:19:49,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,134 INFO L122 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-01-02 00:19:49,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,139 INFO L122 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-01-02 00:19:49,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,145 INFO L122 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-01-02 00:19:49,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,151 INFO L122 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-01-02 00:19:49,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:49,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,168 INFO L122 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-01-02 00:19:49,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:49,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:49,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:49,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,182 INFO L122 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-01-02 00:19:49,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,183 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:49,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:49,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,205 INFO L122 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-01-02 00:19:49,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:49,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:49,218 INFO L122 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-01-02 00:19:49,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:49,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:49,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:49,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:49,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:49,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:49,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:49,287 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:19:49,287 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:19:49,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:49,288 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:49,290 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:49,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-02 00:19:49,389 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:19:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:49,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:49,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:49,594 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-01-02 00:19:49,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-02 00:19:49,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-01-02 00:19:49,784 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-01-02 00:19:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:19:49,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:19:49,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:49,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-02 00:19:49,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:49,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-02 00:19:49,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:49,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-01-02 00:19:49,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:49,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-01-02 00:19:49,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-02 00:19:49,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:19:49,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-01-02 00:19:49,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:49,790 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-02 00:19:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-01-02 00:19:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-02 00:19:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-02 00:19:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-02 00:19:49,793 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-02 00:19:49,793 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-02 00:19:49,793 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:19:49,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-02 00:19:49,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:49,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:49,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:49,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:49,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:49,795 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 260#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 271#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 272#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 267#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 268#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 263#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 264#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 269#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 270#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 262#L544-3 [2019-01-02 00:19:49,795 INFO L796 eck$LassoCheckResult]: Loop: 262#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 266#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 261#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 262#L544-3 [2019-01-02 00:19:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-01-02 00:19:49,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:49,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:49,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:49,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:19:49,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:19:49,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:49,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:50,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:19:50,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:19:50,008 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-02 00:19:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,522 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-02 00:19:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:19:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:19:50,560 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-02 00:19:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:50,804 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-02 00:19:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:19:50,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-02 00:19:50,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:50,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-01-02 00:19:50,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-02 00:19:50,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-02 00:19:50,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-02 00:19:50,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:50,810 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-02 00:19:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-02 00:19:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-01-02 00:19:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:19:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-02 00:19:50,813 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-02 00:19:50,813 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-02 00:19:50,813 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:19:50,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-02 00:19:50,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:50,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:50,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:50,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:50,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:50,815 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 344#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 345#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 355#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 356#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 357#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 360#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 348#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 349#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 352#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 358#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 359#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 353#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 354#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 347#L544-3 [2019-01-02 00:19:50,815 INFO L796 eck$LassoCheckResult]: Loop: 347#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 351#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 346#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 347#L544-3 [2019-01-02 00:19:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-01-02 00:19:50,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:50,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:50,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:50,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-02 00:19:50,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:50,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:50,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-01-02 00:19:50,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:50,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:51,750 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-02 00:19:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:19:51,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:19:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:51,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:52,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-02 00:19:52,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:19:52,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-02 00:19:52,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:19:52,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:19:52,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:19:52,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-01-02 00:19:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:19:52,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:19:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-01-02 00:19:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-02 00:19:52,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-01-02 00:19:52,292 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 19 states. [2019-01-02 00:19:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:53,212 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2019-01-02 00:19:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-02 00:19:53,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-02 00:19:53,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-02 00:19:53,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2019-01-02 00:19:53,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-02 00:19:53,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-02 00:19:53,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-01-02 00:19:53,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:53,220 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-02 00:19:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-01-02 00:19:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2019-01-02 00:19:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-02 00:19:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2019-01-02 00:19:53,226 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-02 00:19:53,226 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-02 00:19:53,226 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:19:53,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2019-01-02 00:19:53,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:19:53,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:53,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:53,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:53,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:53,230 INFO L794 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 516#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 526#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 527#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 528#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 543#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem5;havoc sort_#t~mem4; 519#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 520#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 523#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 537#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 551#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 549#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 546#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 518#L544-3 [2019-01-02 00:19:53,230 INFO L796 eck$LassoCheckResult]: Loop: 518#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 522#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem5;havoc sort_#t~mem4;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 517#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 518#L544-3 [2019-01-02 00:19:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-01-02 00:19:53,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:53,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-01-02 00:19:53,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-01-02 00:19:53,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:53,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:53,712 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-02 00:19:54,075 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2019-01-02 00:19:54,171 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:54,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:54,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:54,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:54,172 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:54,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:54,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:54,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:54,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-02 00:19:54,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:54,173 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,412 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-02 00:19:54,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:54,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:55,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:55,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:55,081 INFO L122 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-01-02 00:19:55,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:55,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:55,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:55,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,084 INFO L122 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-01-02 00:19:55,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:55,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:55,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,088 INFO L122 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-01-02 00:19:55,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:55,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:55,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:55,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,090 INFO L122 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-01-02 00:19:55,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:55,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:55,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:55,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,091 INFO L122 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-01-02 00:19:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:55,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:55,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:55,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,100 INFO L122 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-01-02 00:19:55,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:55,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:55,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,106 INFO L122 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-01-02 00:19:55,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:55,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:55,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:55,115 INFO L122 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-01-02 00:19:55,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:55,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:55,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:55,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:55,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:55,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:55,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:55,152 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:19:55,152 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:55,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:55,153 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:55,153 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:55,153 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-02 00:19:55,332 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-02 00:19:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:55,680 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-01-02 00:19:55,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-02 00:19:55,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-02 00:19:55,714 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-01-02 00:19:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:19:55,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:19:55,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:55,715 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:55,759 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:55,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-02 00:19:55,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-02 00:19:55,801 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-01-02 00:19:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-02 00:19:55,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:19:55,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:55,802 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:55,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:55,866 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:55,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-02 00:19:55,894 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 67 states and 92 transitions. Complement of second has 6 states. [2019-01-02 00:19:55,895 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-01-02 00:19:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-02 00:19:55,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:19:55,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:55,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-02 00:19:55,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:55,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-02 00:19:55,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:55,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2019-01-02 00:19:55,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:55,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2019-01-02 00:19:55,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:55,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:55,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:55,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:55,900 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:55,900 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:55,900 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:55,900 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:19:55,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:55,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:55,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:55,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:55 BoogieIcfgContainer [2019-01-02 00:19:55,908 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:55,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:55,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:55,909 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:55,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:43" (3/4) ... [2019-01-02 00:19:55,913 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:55,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:55,914 INFO L168 Benchmark]: Toolchain (without parser) took 13053.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -216.0 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:55,915 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:55,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:55,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:55,917 INFO L168 Benchmark]: Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:55,919 INFO L168 Benchmark]: RCFGBuilder took 408.67 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:55,920 INFO L168 Benchmark]: BuchiAutomizer took 11910.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:55,920 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:55,926 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 408.67 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11910.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.2s. Construction of modules took 0.8s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 81 SDtfs, 88 SDslu, 64 SDs, 0 SdLazy, 259 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf99 lsp96 ukn66 mio100 lsp60 div100 bol100 ite100 ukn100 eq178 hnf88 smp92 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 5 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...