./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/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 c685955ff6c809f32f6abe44f773ce6a6ae39f94 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:56:52,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:56:52,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:56:52,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:56:52,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:56:52,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:56:52,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:56:52,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:56:52,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:56:52,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:56:52,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:56:52,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:56:52,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:56:52,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:56:52,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:56:52,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:56:52,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:56:52,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:56:52,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:56:52,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:56:52,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:56:52,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:56:52,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:56:52,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:56:52,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:56:52,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:56:52,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:56:52,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:56:52,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:56:52,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:56:52,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:56:52,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:56:52,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:56:52,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:56:52,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:56:52,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:56:52,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:56:52,521 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:56:52,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:56:52,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:56:52,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:56:52,523 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:56:52,523 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:56:52,524 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:56:52,524 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:56:52,525 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:56:52,525 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:56:52,525 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:56:52,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:56:52,525 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:56:52,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:56:52,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:56:52,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:56:52,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:56:52,528 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:56:52,528 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:56:52,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:56:52,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:56:52,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:56:52,528 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:56:52,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:56:52,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:56:52,530 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:56:52,531 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:56:52,532 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 -> c685955ff6c809f32f6abe44f773ce6a6ae39f94 [2019-01-14 04:56:52,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:56:52,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:56:52,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:56:52,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:56:52,614 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:56:52,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:52,676 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6af8d6d/36875fc95c40424ba5e6bb6bb888d069/FLAG1c526da7b [2019-01-14 04:56:53,219 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:56:53,220 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:53,235 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6af8d6d/36875fc95c40424ba5e6bb6bb888d069/FLAG1c526da7b [2019-01-14 04:56:53,478 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6af8d6d/36875fc95c40424ba5e6bb6bb888d069 [2019-01-14 04:56:53,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:56:53,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:56:53,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:53,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:56:53,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:56:53,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:53" (1/1) ... [2019-01-14 04:56:53,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:53, skipping insertion in model container [2019-01-14 04:56:53,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:53" (1/1) ... [2019-01-14 04:56:53,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:56:53,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:56:53,887 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:53,915 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:56:53,977 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:54,040 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:56:54,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54 WrapperNode [2019-01-14 04:56:54,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:54,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:54,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:56:54,042 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:56:54,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:54,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:56:54,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:56:54,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:56:54,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (1/1) ... [2019-01-14 04:56:54,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:56:54,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:56:54,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:56:54,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:56:54,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (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-14 04:56:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:56:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:56:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:56:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:56:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:56:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:56:54,645 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:56:54,646 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:56:54,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:54 BoogieIcfgContainer [2019-01-14 04:56:54,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:56:54,648 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:56:54,648 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:56:54,652 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:56:54,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:54,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:56:53" (1/3) ... [2019-01-14 04:56:54,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@243965a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:54, skipping insertion in model container [2019-01-14 04:56:54,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:54,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:54" (2/3) ... [2019-01-14 04:56:54,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@243965a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:54, skipping insertion in model container [2019-01-14 04:56:54,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:54,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:54" (3/3) ... [2019-01-14 04:56:54,657 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:54,716 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:56:54,717 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:56:54,717 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:56:54,717 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:56:54,718 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:56:54,718 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:56:54,718 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:56:54,718 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:56:54,718 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:56:54,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:56:54,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:56:54,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:54,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:54,759 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:54,759 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:54,759 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:56:54,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:56:54,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:56:54,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:54,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:54,762 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:54,762 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:54,771 INFO L794 eck$LassoCheckResult]: Stem: 8#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; 4#L555true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 11#L543-3true [2019-01-14 04:56:54,771 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 9#L544-3true assume !true; 10#L543-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 11#L543-3true [2019-01-14 04:56:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:56:54,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-01-14 04:56:54,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:54,933 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-14 04:56:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:56:54,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:56:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:56:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:56:54,962 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-14 04:56:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:54,970 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-14 04:56:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:56:54,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-14 04:56:54,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:56:54,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-01-14 04:56:54,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:56:54,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:54,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-14 04:56:54,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:54,982 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:56:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-14 04:56:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 04:56:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:56:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-14 04:56:55,010 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:56:55,010 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:56:55,010 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:56:55,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-01-14 04:56:55,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:56:55,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:55,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:55,013 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:55,013 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:55,013 INFO L794 eck$LassoCheckResult]: Stem: 40#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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 37#L543-3 [2019-01-14 04:56:55,013 INFO L796 eck$LassoCheckResult]: Loop: 37#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 39#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 41#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 37#L543-3 [2019-01-14 04:56:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:56:55,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-01-14 04:56:55,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:55,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2019-01-14 04:56:55,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:55,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:55,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:55,232 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:56:55,363 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:56:55,384 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:55,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:55,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:55,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:55,386 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:56:55,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:55,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:55,387 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:55,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 04:56:55,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:55,388 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:55,413 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-14 04:56:55,425 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-14 04:56:55,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:55,698 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:55,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:56:55,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:56:55,713 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:56:55,713 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:55,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:56:55,748 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:56:55,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:56:55,807 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:55,861 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:56:55,864 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:55,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:55,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:55,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:55,865 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:55,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:55,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:55,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:55,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-14 04:56:55,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:55,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:55,869 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-14 04:56:55,896 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-14 04:56:56,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:56,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:56,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-14 04:56:56,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:56,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:56,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:56,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:56,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:56,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:56,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:56,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:56,104 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-14 04:56:56,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:56,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:56,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:56,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:56,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:56,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:56,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:56,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:56,138 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:56,138 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:56:56,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:56,140 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:56:56,141 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:56,141 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2019-01-14 04:56:56,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:56:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:56,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:56,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:56,286 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-14 04:56:56,290 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-14 04:56:56,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:56:56,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2019-01-14 04:56:56,385 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-14 04:56:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 04:56:56,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 04:56:56,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:56:56,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 04:56:56,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:56,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-01-14 04:56:56,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:56,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2019-01-14 04:56:56,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:56:56,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:56,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-01-14 04:56:56,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:56,394 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 04:56:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-01-14 04:56:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-14 04:56:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:56:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-01-14 04:56:56,397 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 04:56:56,397 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 04:56:56,397 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:56:56,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-01-14 04:56:56,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:56,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:56,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:56,399 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:56:56,399 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:56,399 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 99#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; 100#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 101#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 102#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 104#L544-3 [2019-01-14 04:56:56,399 INFO L796 eck$LassoCheckResult]: Loop: 104#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 108#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 103#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 104#L544-3 [2019-01-14 04:56:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 04:56:56,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-14 04:56:56,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-14 04:56:56,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:56,874 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:56:57,568 WARN L181 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-14 04:56:57,672 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:57,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:57,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:57,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:57,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:57,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:57,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:57,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:57,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:56:57,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:57,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:57,679 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-14 04:56:57,693 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-14 04:56:57,695 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-14 04:56:57,699 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-14 04:56:57,710 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-14 04:56:57,713 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-14 04:56:57,916 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-14 04:56:58,022 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-14 04:56:58,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:58,031 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-14 04:56:58,033 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-14 04:56:58,036 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-14 04:56:58,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:58,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:58,560 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-14 04:56:58,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,564 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-14 04:56:58,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,568 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-14 04:56:58,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,574 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-14 04:56:58,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,582 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-14 04:56:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:58,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:58,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:58,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,586 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-14 04:56:58,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:58,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:58,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:58,623 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-14 04:56:58,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:58,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:58,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:58,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:58,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:58,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:58,693 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:58,757 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:56:58,759 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:56:58,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:58,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:58,766 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:58,766 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1, ULTIMATE.start_bubbleSort_~j~0) = 16*ULTIMATE.start_bubbleSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 16*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2019-01-14 04:56:58,886 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:56:58,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:56:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:59,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:59,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:59,105 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-14 04:56:59,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:56:59,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:56:59,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 41 transitions. Complement of second has 8 states. [2019-01-14 04:56:59,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:56:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 04:56:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 04:56:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 04:56:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:59,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 04:56:59,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:59,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2019-01-14 04:56:59,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:59,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2019-01-14 04:56:59,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:56:59,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:56:59,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-01-14 04:56:59,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:59,203 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-01-14 04:56:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-01-14 04:56:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-01-14 04:56:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:56:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-14 04:56:59,205 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 04:56:59,205 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 04:56:59,205 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:56:59,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-01-14 04:56:59,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:59,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:59,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:59,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:59,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:59,209 INFO L794 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 211#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; 212#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 213#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 214#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 218#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 220#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 221#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 216#L544-3 [2019-01-14 04:56:59,209 INFO L796 eck$LassoCheckResult]: Loop: 216#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 222#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 215#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 216#L544-3 [2019-01-14 04:56:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2019-01-14 04:56:59,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:59,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:59,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:59,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:56:59,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-14 04:56:59,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:59,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,570 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:56:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:56:59,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:56:59,621 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-14 04:56:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:59,677 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-01-14 04:56:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:56:59,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 04:56:59,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:59,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-01-14 04:56:59,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:56:59,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:56:59,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-01-14 04:56:59,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:59,683 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 04:56:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-01-14 04:56:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-14 04:56:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:56:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-14 04:56:59,685 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 04:56:59,685 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 04:56:59,685 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:56:59,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-14 04:56:59,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:56:59,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:59,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:59,687 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:59,687 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:56:59,687 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#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; 258#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 259#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 260#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 267#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 268#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 263#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 264#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 269#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 270#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 262#L544-3 [2019-01-14 04:56:59,687 INFO L796 eck$LassoCheckResult]: Loop: 262#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 266#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 261#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 262#L544-3 [2019-01-14 04:56:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-01-14 04:56:59,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:59,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-14 04:56:59,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2019-01-14 04:56:59,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:59,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:59,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:59,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:59,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:57:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-14 04:57:00,356 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:57:00,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 04:57:00,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-14 04:57:00,381 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-01-14 04:57:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:00,484 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-14 04:57:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:57:00,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-14 04:57:00,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:00,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-01-14 04:57:00,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 04:57:00,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 04:57:00,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-14 04:57:00,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:00,490 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 04:57:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-14 04:57:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-01-14 04:57:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:57:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 04:57:00,495 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:57:00,495 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:57:00,495 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:57:00,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 04:57:00,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:00,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:00,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:00,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:00,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:00,499 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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; 363#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 364#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 365#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 375#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 378#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 368#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 369#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 372#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 376#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 377#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 373#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 374#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 367#L544-3 [2019-01-14 04:57:00,499 INFO L796 eck$LassoCheckResult]: Loop: 367#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 371#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 366#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 367#L544-3 [2019-01-14 04:57:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:00,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-01-14 04:57:00,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:00,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-01-14 04:57:00,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2019-01-14 04:57:00,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:00,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:01,017 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-01-14 04:57:01,158 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-01-14 04:57:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:01,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:57:01,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:57:01,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:57:01,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:57:01,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:57:01,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:01,507 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 26 treesize of output 18 [2019-01-14 04:57:01,516 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 18 treesize of output 10 [2019-01-14 04:57:01,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:57:01,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:01,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:01,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-01-14 04:57:01,550 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-14 04:57:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:57:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-01-14 04:57:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 04:57:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-14 04:57:01,686 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-01-14 04:57:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:01,859 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-01-14 04:57:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 04:57:01,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-01-14 04:57:01,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:57:01,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-01-14 04:57:01,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:57:01,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:57:01,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-01-14 04:57:01,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:01,867 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-14 04:57:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-01-14 04:57:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-01-14 04:57:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 04:57:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-14 04:57:01,872 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 04:57:01,872 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 04:57:01,872 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:57:01,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-14 04:57:01,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:01,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:01,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:01,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:01,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:01,874 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 483#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; 484#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 485#L555-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;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 486#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 497#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 505#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 489#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 490#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 494#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 500#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 504#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 495#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 496#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 488#L544-3 [2019-01-14 04:57:01,874 INFO L796 eck$LassoCheckResult]: Loop: 488#L544-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 508#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 487#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 488#L544-3 [2019-01-14 04:57:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2019-01-14 04:57:01,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2019-01-14 04:57:01,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:01,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2019-01-14 04:57:01,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:01,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:01,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:01,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:02,199 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 04:57:02,616 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2019-01-14 04:57:02,698 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:02,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:02,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:02,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:02,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:02,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:02,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:02,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:02,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-14 04:57:02,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:02,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:02,706 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-14 04:57:02,709 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-14 04:57:02,710 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-14 04:57:02,713 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-14 04:57:02,715 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-14 04:57:02,718 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-14 04:57:02,993 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-01-14 04:57:03,099 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-14 04:57:03,105 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-14 04:57:03,107 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-14 04:57:03,112 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-14 04:57:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:03,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:03,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:03,456 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-14 04:57:03,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:03,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:03,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:03,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:03,463 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-14 04:57:03,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:03,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:03,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:03,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:03,470 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-14 04:57:03,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:03,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:03,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:03,474 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-14 04:57:03,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:03,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:03,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:03,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:03,479 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-14 04:57:03,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:03,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:03,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:03,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:03,485 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-14 04:57:03,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:03,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:03,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:03,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:03,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:03,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:03,508 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:03,519 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:03,519 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:57:03,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:03,521 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:03,522 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:03,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2, ULTIMATE.start_bubbleSort_~j~0) = -1*ULTIMATE.start_bubbleSort_~numbers.offset + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2019-01-14 04:57:03,624 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 04:57:03,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,688 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-14 04:57:03,688 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-14 04:57:03,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 04:57:03,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2019-01-14 04:57:03,720 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-14 04:57:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:03,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:03,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:03,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,794 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-14 04:57:03,794 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-14 04:57:03,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 04:57:03,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2019-01-14 04:57:03,827 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-14 04:57:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:03,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:03,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:03,828 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:03,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:03,896 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-14 04:57:03,896 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-14 04:57:03,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 04:57:03,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 58 transitions. Complement of second has 6 states. [2019-01-14 04:57:03,931 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-14 04:57:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 04:57:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:03,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:03,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 04:57:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:03,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 04:57:03,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:03,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-01-14 04:57:03,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:03,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-14 04:57:03,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:03,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:03,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:03,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:03,936 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:03,936 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:03,936 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:03,936 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:57:03,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:03,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:03,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:03,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:03 BoogieIcfgContainer [2019-01-14 04:57:03,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:03,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:03,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:03,945 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:03,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:54" (3/4) ... [2019-01-14 04:57:03,949 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:03,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:03,950 INFO L168 Benchmark]: Toolchain (without parser) took 10467.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 946.0 MB in the beginning and 828.4 MB in the end (delta: 117.6 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:03,951 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:03,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.26 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:03,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:03,954 INFO L168 Benchmark]: Boogie Preprocessor took 28.60 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-14 04:57:03,954 INFO L168 Benchmark]: RCFGBuilder took 444.25 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:03,955 INFO L168 Benchmark]: BuchiAutomizer took 9296.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 828.4 MB in the end (delta: 274.9 MB). Peak memory consumption was 349.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:03,956 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.2 GB. Free memory is still 828.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:03,961 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.26 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 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 132.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.60 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 444.25 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9296.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 828.4 MB in the end (delta: 274.9 MB). Peak memory consumption was 349.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.2 GB. Free memory is still 828.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function 16 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] + -16 * j and consists of 5 locations. One nondeterministic module has affine ranking function -1 * numbers + unknown-#length-unknown[numbers] + -4 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 106 SDslu, 77 SDs, 0 SdLazy, 169 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf96 lsp98 ukn80 mio100 lsp80 div100 bol100 ite100 ukn100 eq171 hnf90 smp88 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...