./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65401fe061f89bb729dffabf74050dfab9fe7d77 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:57:40,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:40,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:40,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:40,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:40,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:40,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:40,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:40,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:40,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:40,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:40,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:40,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:40,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:40,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:40,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:40,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:40,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:40,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:40,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:40,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:40,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:40,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:40,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:40,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:40,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:40,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:40,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:40,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:40,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:40,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:40,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:40,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:40,530 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:40,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:40,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:40,532 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:57:40,548 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:40,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:40,550 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:40,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:40,550 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:40,551 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:40,551 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:40,551 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:40,551 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:40,551 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:40,551 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:40,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:40,552 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:40,552 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:40,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:40,552 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:40,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:40,553 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:40,554 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:40,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:40,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:40,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:40,554 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:40,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:40,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:40,555 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:40,556 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:40,556 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65401fe061f89bb729dffabf74050dfab9fe7d77 [2019-01-14 04:57:40,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:40,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:40,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:40,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:40,607 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:40,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:40,671 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10baa8ec5/f94ac1c437d540f0a11d075156a2f05d/FLAG3ef9f51b6 [2019-01-14 04:57:41,151 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:41,152 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:41,163 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10baa8ec5/f94ac1c437d540f0a11d075156a2f05d/FLAG3ef9f51b6 [2019-01-14 04:57:41,465 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10baa8ec5/f94ac1c437d540f0a11d075156a2f05d [2019-01-14 04:57:41,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:41,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:41,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:41,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:41,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:41,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:41" (1/1) ... [2019-01-14 04:57:41,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92648db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:41, skipping insertion in model container [2019-01-14 04:57:41,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:41" (1/1) ... [2019-01-14 04:57:41,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:41,536 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:41,938 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:41,955 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:42,077 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:42,134 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:42,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42 WrapperNode [2019-01-14 04:57:42,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:42,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:42,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:42,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:42,145 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:57:42" (1/1) ... [2019-01-14 04:57:42,159 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:57:42" (1/1) ... [2019-01-14 04:57:42,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:42,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:42,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:42,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:42,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (1/1) ... [2019-01-14 04:57:42,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:42,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:42,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:42,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:42,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (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:57:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:42,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:42,780 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:42,781 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:42,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:42 BoogieIcfgContainer [2019-01-14 04:57:42,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:42,783 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:42,783 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:42,787 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:42,788 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:42,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:41" (1/3) ... [2019-01-14 04:57:42,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e49e6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:42, skipping insertion in model container [2019-01-14 04:57:42,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:42,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:42" (2/3) ... [2019-01-14 04:57:42,790 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e49e6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:42, skipping insertion in model container [2019-01-14 04:57:42,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:42,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:42" (3/3) ... [2019-01-14 04:57:42,792 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:42,846 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:42,846 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:42,846 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:42,846 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:42,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:42,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:42,847 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:42,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:42,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:42,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:57:42,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:42,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:42,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:42,890 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:57:42,890 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:42,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:42,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:57:42,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:42,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:42,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:42,893 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:57:42,893 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:42,900 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 10#L551true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15#L551-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 11#L543-3true [2019-01-14 04:57:42,900 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 8#L544-3true assume !true; 9#L543-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 11#L543-3true [2019-01-14 04:57:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:57:42,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-01-14 04:57:43,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:43,055 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:43,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:43,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:43,062 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:57:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:57:43,080 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-14 04:57:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:43,090 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-14 04:57:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:57:43,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-14 04:57:43,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:43,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-01-14 04:57:43,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:57:43,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:57:43,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-14 04:57:43,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:43,101 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:57:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-14 04:57:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 04:57:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:57:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-14 04:57:43,132 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:57:43,132 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 04:57:43,132 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:43,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-01-14 04:57:43,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:57:43,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:43,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:43,136 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:57:43,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:43,137 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 41#L543-3 [2019-01-14 04:57:43,137 INFO L796 eck$LassoCheckResult]: Loop: 41#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 37#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 39#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 41#L543-3 [2019-01-14 04:57:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:57:43,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-01-14 04:57:43,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:43,299 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:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:43,301 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:57:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:57:43,302 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:57:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:43,417 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-14 04:57:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:57:43,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-14 04:57:43,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:57:43,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 04:57:43,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:57:43,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:57:43,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 04:57:43,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:43,422 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:57:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 04:57:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 04:57:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:57:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 04:57:43,424 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:57:43,424 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:57:43,424 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:43,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 04:57:43,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 04:57:43,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:43,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:43,426 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:57:43,426 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:43,426 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 68#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 67#L543-3 [2019-01-14 04:57:43,426 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 64#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 65#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 61#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 62#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 66#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 67#L543-3 [2019-01-14 04:57:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-01-14 04:57:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-01-14 04:57:43,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:43,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-01-14 04:57:43,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:43,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:43,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:43,920 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-14 04:57:44,305 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:57:44,435 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 04:57:44,456 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:44,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:44,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:44,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:44,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:44,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:44,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:44,458 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:44,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:57:44,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:44,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:44,483 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:44,517 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:44,536 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:44,538 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:44,548 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:44,551 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:45,211 WARN L181 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:57:45,258 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:45,264 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:45,268 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:45,273 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:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:45,829 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:45,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:45,836 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:45,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:45,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:45,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:45,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,846 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:45,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:45,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:45,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:45,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,851 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:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:45,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:45,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:45,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,857 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:45,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:45,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:45,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,867 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:45,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:45,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:45,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:45,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,873 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:45,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:45,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:45,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:45,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,884 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:45,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,886 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:57:45,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,892 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:57:45,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:45,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,913 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:45,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:45,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:45,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:45,922 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:45,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:45,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:45,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:45,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:45,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:45,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:46,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:46,115 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:57:46,115 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:57:46,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:46,120 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:46,121 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:46,122 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-14 04:57:46,236 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:57:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:46,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:46,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 04:57:46,366 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:46,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:57:46,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2019-01-14 04:57:46,427 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:57:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 04:57:46,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 04:57:46,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:46,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 04:57:46,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:46,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-14 04:57:46,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:46,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-14 04:57:46,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:46,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-01-14 04:57:46,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:57:46,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:57:46,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-01-14 04:57:46,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:46,436 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 04:57:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-01-14 04:57:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 04:57:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:57:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-14 04:57:46,438 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 04:57:46,438 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-14 04:57:46,438 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:46,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-14 04:57:46,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:46,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:46,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:46,440 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:46,440 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:46,440 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 163#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 164#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 154#L544-3 [2019-01-14 04:57:46,440 INFO L796 eck$LassoCheckResult]: Loop: 154#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 158#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 153#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 154#L544-3 [2019-01-14 04:57:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 04:57:46,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:46,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-14 04:57:46,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-14 04:57:46,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:46,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:46,682 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 04:57:47,014 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-14 04:57:47,068 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:47,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:47,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:47,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:47,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:47,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:47,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:47,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:47,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:57:47,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:47,070 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:47,074 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:47,086 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:47,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:47,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:47,102 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:47,104 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:47,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:47,110 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:47,113 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:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:47,119 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:47,284 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-14 04:57:47,557 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 04:57:47,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:47,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:47,833 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:47,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,840 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:47,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,845 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:47,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:47,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,853 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:47,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,858 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:47,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,864 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:47,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:47,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,871 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:47,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,877 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:47,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,882 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:47,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,889 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:47,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,894 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:47,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:47,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,907 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:47,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:47,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:47,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:47,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,914 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:47,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,915 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:57:47,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:57:47,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,930 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:47,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:47,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:47,938 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:47,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:47,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:47,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:47,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:47,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:47,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:47,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:47,991 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 04:57:47,992 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:57:47,992 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:47,993 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:47,994 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:47,994 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-14 04:57:48,062 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:57:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:48,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:48,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:48,388 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:48,388 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:48,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 04:57:48,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-01-14 04:57:48,499 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:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:48,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 04:57:48,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:48,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 04:57:48,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:48,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 04:57:48,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:48,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-01-14 04:57:48,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:48,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-01-14 04:57:48,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:57:48,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 04:57:48,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-01-14 04:57:48,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:48,506 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 04:57:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-01-14 04:57:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-14 04:57:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:57:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-14 04:57:48,509 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 04:57:48,509 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 04:57:48,509 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:57:48,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-14 04:57:48,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:48,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:48,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:48,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:48,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:48,511 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 260#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 271#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 272#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 267#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 268#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 263#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 264#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 269#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 270#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 262#L544-3 [2019-01-14 04:57:48,511 INFO L796 eck$LassoCheckResult]: Loop: 262#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 266#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 261#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 262#L544-3 [2019-01-14 04:57:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:48,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-01-14 04:57:48,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:48,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:48,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:48,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:48,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:57:48,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:57:48,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:48,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:48,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:57:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:57:48,860 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:57:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-14 04:57:48,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:48,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:48,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:49,022 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 04:57:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:57:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:57:49,058 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-14 04:57:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:49,129 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-14 04:57:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:57:49,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-14 04:57:49,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:49,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-01-14 04:57:49,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 04:57:49,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 04:57:49,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-14 04:57:49,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:49,137 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-14 04:57:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-14 04:57:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-01-14 04:57:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:57:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 04:57:49,140 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:57:49,140 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:57:49,140 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:57:49,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 04:57:49,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:49,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:49,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:49,143 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:49,143 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:49,143 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 344#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 345#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 355#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 356#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 357#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 360#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 348#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 349#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 352#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 358#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 359#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 353#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 354#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 347#L544-3 [2019-01-14 04:57:49,143 INFO L796 eck$LassoCheckResult]: Loop: 347#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 351#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 346#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 347#L544-3 [2019-01-14 04:57:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-01-14 04:57:49,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:49,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-14 04:57:49,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:49,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-01-14 04:57:49,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:49,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:50,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:57:50,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:57:50,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:50,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:50,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-14 04:57:50,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 04:57:50,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 04:57:50,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:57:50,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:50,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:50,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-01-14 04:57:50,567 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:50,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:57:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-01-14 04:57:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 04:57:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-01-14 04:57:50,685 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 19 states. [2019-01-14 04:57:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:51,446 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2019-01-14 04:57:51,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 04:57:51,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-14 04:57:51,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-14 04:57:51,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2019-01-14 04:57:51,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 04:57:51,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-14 04:57:51,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-01-14 04:57:51,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:51,454 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-14 04:57:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-01-14 04:57:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2019-01-14 04:57:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 04:57:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2019-01-14 04:57:51,459 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-14 04:57:51,459 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-14 04:57:51,459 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:57:51,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2019-01-14 04:57:51,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:57:51,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:51,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:51,465 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:51,465 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:51,466 INFO L794 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 516#L551 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 526#L551-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 527#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 528#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 543#L545 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 519#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 520#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 523#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 537#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 551#L544-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 549#L543-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 546#L543-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 518#L544-3 [2019-01-14 04:57:51,468 INFO L796 eck$LassoCheckResult]: Loop: 518#L544-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 522#L545 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 517#L544-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 518#L544-3 [2019-01-14 04:57:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-01-14 04:57:51,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-01-14 04:57:51,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-01-14 04:57:51,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:51,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:51,709 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 04:57:52,091 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2019-01-14 04:57:52,182 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:52,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:52,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:52,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:52,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:52,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:52,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:52,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:52,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-14 04:57:52,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:52,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:52,188 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:52,193 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:52,195 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:52,198 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:52,201 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:52,422 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-14 04:57:52,594 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 04:57:52,594 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:52,602 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:52,604 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:52,608 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:52,616 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:52,617 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:53,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:53,146 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:53,146 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:53,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:53,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:53,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:53,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,152 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:53,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:53,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:53,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,160 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:53,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:53,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:53,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:53,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,165 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:53,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:53,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:53,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:53,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,167 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:53,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,173 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:57:53,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,176 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:57:53,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:53,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,183 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:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:53,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:53,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,192 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:53,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:53,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:53,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:53,216 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:53,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:53,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:53,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:53,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:53,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:53,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:53,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:53,280 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:57:53,280 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:53,281 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:53,282 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:53,283 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:53,283 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-14 04:57:53,450 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 04:57:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,770 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:53,771 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:53,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-14 04:57:53,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-14 04:57:53,802 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:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:53,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:53,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:53,803 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,849 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:53,849 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:53,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-14 04:57:53,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-14 04:57:53,876 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:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:53,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:53,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:53,877 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:53,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:53,926 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:53,926 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:53,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-14 04:57:53,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 67 states and 92 transitions. Complement of second has 6 states. [2019-01-14 04:57:53,951 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:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 04:57:53,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:57:53,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:53,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 04:57:53,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:53,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 04:57:53,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:53,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2019-01-14 04:57:53,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:53,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:53,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:53,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:53,959 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:57:53,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:53,959 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:53,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:53,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:53 BoogieIcfgContainer [2019-01-14 04:57:53,966 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:53,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:53,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:53,967 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:53,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:42" (3/4) ... [2019-01-14 04:57:53,970 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:53,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:53,971 INFO L168 Benchmark]: Toolchain (without parser) took 12501.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:53,972 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:53,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:53,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.36 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:53,974 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 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:53,977 INFO L168 Benchmark]: RCFGBuilder took 559.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:53,977 INFO L168 Benchmark]: BuchiAutomizer took 11183.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.6 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:53,979 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:53,985 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.36 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. * Boogie Preprocessor took 39.27 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 559.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11183.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.6 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 81 SDtfs, 88 SDslu, 64 SDs, 0 SdLazy, 259 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf99 lsp96 ukn66 mio100 lsp60 div100 bol100 ite100 ukn100 eq178 hnf88 smp92 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...