./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:13:40,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:13:40,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:13:40,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:13:40,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:13:40,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:13:40,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:13:40,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:13:40,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:13:40,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:13:40,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:13:40,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:13:40,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:13:40,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:13:40,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:13:40,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:13:40,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:13:40,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:13:40,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:13:40,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:13:40,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:13:40,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:13:40,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:13:40,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:13:40,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:13:40,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:13:40,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:13:40,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:13:40,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:13:40,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:13:40,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:13:40,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:13:40,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:13:40,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:13:40,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:13:40,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:13:40,271 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:13:40,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:13:40,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:13:40,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:13:40,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:13:40,283 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:13:40,283 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:13:40,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:13:40,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:13:40,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:13:40,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:13:40,285 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:13:40,286 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:13:40,286 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2018-11-10 12:13:40,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:13:40,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:13:40,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:13:40,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:13:40,318 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:13:40,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-11-10 12:13:40,354 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/data/6ab4f4221/aeb6ebeceaea4111a1733225c3fecbc3/FLAG297fc7ebb [2018-11-10 12:13:40,793 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:13:40,794 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-11-10 12:13:40,802 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/data/6ab4f4221/aeb6ebeceaea4111a1733225c3fecbc3/FLAG297fc7ebb [2018-11-10 12:13:40,810 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/data/6ab4f4221/aeb6ebeceaea4111a1733225c3fecbc3 [2018-11-10 12:13:40,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:13:40,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:13:40,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:13:40,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:13:40,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:13:40,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:13:40" (1/1) ... [2018-11-10 12:13:40,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d317d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:40, skipping insertion in model container [2018-11-10 12:13:40,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:13:40" (1/1) ... [2018-11-10 12:13:40,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:13:40,850 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:13:41,020 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:13:41,027 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:13:41,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:13:41,086 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:13:41,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41 WrapperNode [2018-11-10 12:13:41,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:13:41,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:13:41,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:13:41,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:13:41,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:13:41,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:13:41,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:13:41,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:13:41,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... [2018-11-10 12:13:41,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:13:41,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:13:41,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:13:41,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:13:41,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/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 [2018-11-10 12:13:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:13:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:13:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:13:41,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:13:41,428 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:13:41,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:41 BoogieIcfgContainer [2018-11-10 12:13:41,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:13:41,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:13:41,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:13:41,431 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:13:41,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:13:41,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:13:40" (1/3) ... [2018-11-10 12:13:41,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54dd6d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:13:41, skipping insertion in model container [2018-11-10 12:13:41,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:13:41,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:41" (2/3) ... [2018-11-10 12:13:41,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54dd6d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:13:41, skipping insertion in model container [2018-11-10 12:13:41,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:13:41,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:41" (3/3) ... [2018-11-10 12:13:41,434 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-termination.c.i [2018-11-10 12:13:41,468 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:13:41,468 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:13:41,468 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:13:41,468 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:13:41,468 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:13:41,468 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:13:41,469 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:13:41,469 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:13:41,469 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:13:41,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 12:13:41,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:13:41,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:41,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:41,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:13:41,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 12:13:41,499 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:13:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 12:13:41,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:13:41,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:41,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:41,501 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:13:41,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 12:13:41,507 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 18#L562true assume !(main_~array_size~0 < 1); 23#L562-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 7#L550-4true [2018-11-10 12:13:41,507 INFO L795 eck$LassoCheckResult]: Loop: 7#L550-4true assume true; 25#L550-1true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 5#L551-4true assume !true; 6#L550-3true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 7#L550-4true [2018-11-10 12:13:41,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 12:13:41,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:41,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1329512, now seen corresponding path program 1 times [2018-11-10 12:13:41,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:41,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:41,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:41,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:13:41,612 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:13:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:13:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:13:41,622 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 12:13:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:41,627 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 12:13:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:13:41,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 12:13:41,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:13:41,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 12:13:41,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 12:13:41,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 12:13:41,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 12:13:41,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:13:41,633 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 12:13:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 12:13:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 12:13:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 12:13:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 12:13:41,650 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 12:13:41,650 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 12:13:41,650 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:13:41,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 12:13:41,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:13:41,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:41,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:41,651 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:13:41,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 12:13:41,651 INFO L793 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 64#L562 assume !(main_~array_size~0 < 1); 71#L562-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 58#L550-4 [2018-11-10 12:13:41,652 INFO L795 eck$LassoCheckResult]: Loop: 58#L550-4 assume true; 59#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 55#L551-4 assume true; 56#L551-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 57#L550-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 58#L550-4 [2018-11-10 12:13:41,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 12:13:41,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash 41193125, now seen corresponding path program 1 times [2018-11-10 12:13:41,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924673, now seen corresponding path program 1 times [2018-11-10 12:13:41,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:41,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:41,732 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:13:41,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:13:41,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:13:41,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:13:41,733 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:13:41,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:41,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:13:41,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:13:41,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-11-10 12:13:41,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:13:41,734 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:13:41,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,903 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:13:41,903 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:41,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:13:41,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:13:41,914 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:13:41,915 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:41,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:13:41,939 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:41,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:13:41,956 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:13:41,976 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:13:41,977 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:13:41,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:13:41,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:13:41,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:13:41,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:13:41,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:41,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:13:41,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:13:41,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-11-10 12:13:41,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:13:41,978 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:13:41,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:41,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,049 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:13:42,052 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:13:42,053 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 [2018-11-10 12:13:42,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:42,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:42,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:42,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,059 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 [2018-11-10 12:13:42,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:42,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:42,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:42,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:13:42,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:13:42,070 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:13:42,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:13:42,072 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:13:42,072 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:13:42,073 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2018-11-10 12:13:42,075 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:13:42,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:42,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:42,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:42,146 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 [2018-11-10 12:13:42,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 12:13:42,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 34 states and 40 transitions. Complement of second has 6 states. [2018-11-10 12:13:42,180 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 [2018-11-10 12:13:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:13:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 12:13:42,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-10 12:13:42,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:42,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-10 12:13:42,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:42,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-10 12:13:42,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:42,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-10 12:13:42,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:42,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-11-10 12:13:42,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 12:13:42,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 12:13:42,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-10 12:13:42,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:13:42,185 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 12:13:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-10 12:13:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 12:13:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 12:13:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-10 12:13:42,188 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 12:13:42,188 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 12:13:42,188 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:13:42,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-10 12:13:42,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:42,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:42,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:42,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:13:42,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:13:42,191 INFO L793 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 175#L562 assume !(main_~array_size~0 < 1); 187#L562-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 165#L550-4 assume true; 167#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 158#L551-4 [2018-11-10 12:13:42,191 INFO L795 eck$LassoCheckResult]: Loop: 158#L551-4 assume true; 161#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 183#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 184#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 188#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 157#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 158#L551-4 [2018-11-10 12:13:42,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 12:13:42,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:42,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 1 times [2018-11-10 12:13:42,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 577380690, now seen corresponding path program 1 times [2018-11-10 12:13:42,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:42,432 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 12:13:42,473 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:13:42,473 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:13:42,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:13:42,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:13:42,473 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:13:42,473 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:42,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:13:42,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:13:42,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 12:13:42,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:13:42,474 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:13:42,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,641 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-10 12:13:42,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:42,933 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:13:42,933 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:13:42,934 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 [2018-11-10 12:13:42,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:42,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:42,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:42,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,939 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 [2018-11-10 12:13:42,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:42,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:42,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:42,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,942 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 [2018-11-10 12:13:42,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:42,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:42,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,949 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 [2018-11-10 12:13:42,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:42,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:42,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,964 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 [2018-11-10 12:13:42,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,965 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:13:42,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,968 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:13:42,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:42,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,982 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 [2018-11-10 12:13:42,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:42,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:42,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,989 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 [2018-11-10 12:13:42,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:42,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:42,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:42,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:42,997 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 [2018-11-10 12:13:42,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:42,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:42,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:42,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:43,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:43,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:43,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:13:43,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:13:43,046 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:13:43,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:13:43,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:13:43,048 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:13:43,048 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2018-11-10 12:13:43,078 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 12:13:43,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:43,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:43,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:43,110 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 [2018-11-10 12:13:43,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:13:43,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 90 states and 103 transitions. Complement of second has 7 states. [2018-11-10 12:13:43,135 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 [2018-11-10 12:13:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:13:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 12:13:43,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-10 12:13:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:43,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:13:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:43,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 12:13:43,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:43,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 103 transitions. [2018-11-10 12:13:43,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 51 states and 59 transitions. [2018-11-10 12:13:43,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 12:13:43,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 12:13:43,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2018-11-10 12:13:43,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:13:43,139 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-10 12:13:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2018-11-10 12:13:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-10 12:13:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 12:13:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-10 12:13:43,141 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-10 12:13:43,142 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-10 12:13:43,142 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:13:43,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2018-11-10 12:13:43,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:43,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:43,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,158 INFO L793 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 376#L562 assume !(main_~array_size~0 < 1); 389#L562-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 365#L550-4 assume true; 366#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 359#L551-4 assume true; 396#L551-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 363#L550-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 364#L550-4 assume true; 368#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 357#L551-4 [2018-11-10 12:13:43,158 INFO L795 eck$LassoCheckResult]: Loop: 357#L551-4 assume true; 360#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 384#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 385#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 390#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 356#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 357#L551-4 [2018-11-10 12:13:43,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1958245030, now seen corresponding path program 2 times [2018-11-10 12:13:43,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:43,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:43,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:13:43,185 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:13:43,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 2 times [2018-11-10 12:13:43,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:13:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:13:43,219 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 12:13:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:43,252 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-10 12:13:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:13:43,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 99 transitions. [2018-11-10 12:13:43,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 83 states and 93 transitions. [2018-11-10 12:13:43,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 12:13:43,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 12:13:43,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 93 transitions. [2018-11-10 12:13:43,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:13:43,254 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-10 12:13:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 93 transitions. [2018-11-10 12:13:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2018-11-10 12:13:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 12:13:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 12:13:43,257 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 12:13:43,257 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 12:13:43,257 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:13:43,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2018-11-10 12:13:43,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:43,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:43,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,259 INFO L793 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 523#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 524#L562 assume !(main_~array_size~0 < 1); 536#L562-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 513#L550-4 assume true; 514#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 509#L551-4 assume true; 510#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 534#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 535#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 538#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 506#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 507#L551-4 assume true; 542#L551-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 511#L550-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 512#L550-4 assume true; 515#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 505#L551-4 [2018-11-10 12:13:43,259 INFO L795 eck$LassoCheckResult]: Loop: 505#L551-4 assume true; 508#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 532#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 533#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 537#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 504#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 505#L551-4 [2018-11-10 12:13:43,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1393429858, now seen corresponding path program 1 times [2018-11-10 12:13:43,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 3 times [2018-11-10 12:13:43,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash -446609242, now seen corresponding path program 2 times [2018-11-10 12:13:43,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:43,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:43,349 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf37eddc-c6f3-4769-a104-36d16cd2ded8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:13:43,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:13:43,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:13:43,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:13:43,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:43,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:43,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-10 12:13:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:13:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:13:43,497 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. cyclomatic complexity: 10 Second operand 13 states. [2018-11-10 12:13:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:43,582 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-11-10 12:13:43,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:13:43,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 142 transitions. [2018-11-10 12:13:43,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 119 states and 132 transitions. [2018-11-10 12:13:43,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 12:13:43,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 12:13:43,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 132 transitions. [2018-11-10 12:13:43,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:13:43,585 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-11-10 12:13:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 132 transitions. [2018-11-10 12:13:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2018-11-10 12:13:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 12:13:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-10 12:13:43,588 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 12:13:43,588 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 12:13:43,588 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:13:43,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2018-11-10 12:13:43,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 12:13:43,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:13:43,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:13:43,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:13:43,590 INFO L793 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 794#L562 assume !(main_~array_size~0 < 1); 807#L562-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 782#L550-4 assume true; 783#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 811#L551-4 assume true; 828#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 825#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 822#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 818#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 817#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 778#L551-4 assume true; 779#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 804#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 805#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 809#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 788#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 815#L551-4 assume true; 812#L551-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 780#L550-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 781#L550-4 assume true; 784#L550-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 774#L551-4 [2018-11-10 12:13:43,590 INFO L795 eck$LassoCheckResult]: Loop: 774#L551-4 assume true; 777#L551-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0); 802#L552 SUMMARY for call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + (bubbleSort_~j~0 - 1) * 4, 4); srcloc: L552 803#L552-1 SUMMARY for call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + bubbleSort_~j~0 * 4, 4); srcloc: L552-1 808#L552-2 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 773#L551-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := bubbleSort_#t~post3 + 1;havoc bubbleSort_#t~post3; 774#L551-4 [2018-11-10 12:13:43,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1931896682, now seen corresponding path program 3 times [2018-11-10 12:13:43,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 4 times [2018-11-10 12:13:43,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1623026530, now seen corresponding path program 4 times [2018-11-10 12:13:43,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:43,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:13:43,859 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 12:13:43,910 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:13:43,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:13:43,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:13:43,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:13:43,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:13:43,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:13:43,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:13:43,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:13:43,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 12:13:43,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:13:43,911 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:13:43,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:43,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:13:44,090 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-11-10 12:13:44,350 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:13:44,350 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:13:44,350 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 [2018-11-10 12:13:44,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,353 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 [2018-11-10 12:13:44,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,354 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 [2018-11-10 12:13:44,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,356 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 [2018-11-10 12:13:44,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,357 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 [2018-11-10 12:13:44,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,359 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 [2018-11-10 12:13:44,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,361 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 [2018-11-10 12:13:44,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,362 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 [2018-11-10 12:13:44,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,366 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 [2018-11-10 12:13:44,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,368 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 [2018-11-10 12:13:44,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,375 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 [2018-11-10 12:13:44,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,377 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 [2018-11-10 12:13:44,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,380 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 [2018-11-10 12:13:44,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,383 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 [2018-11-10 12:13:44,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:13:44,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:13:44,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:13:44,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,385 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 [2018-11-10 12:13:44,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,388 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 [2018-11-10 12:13:44,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,392 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 [2018-11-10 12:13:44,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,395 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 [2018-11-10 12:13:44,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,396 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:13:44,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,398 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:13:44,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,406 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 [2018-11-10 12:13:44,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:13:44,414 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 [2018-11-10 12:13:44,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:13:44,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:13:44,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:13:44,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:13:44,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:13:44,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:13:44,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:13:44,460 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 12:13:44,460 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:13:44,461 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:13:44,461 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:13:44,462 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:13:44,462 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0) = 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 - 1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2018-11-10 12:13:44,512 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 12:13:44,514 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:13:44,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:44,574 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 [2018-11-10 12:13:44,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 12:13:44,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 12:13:44,605 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 [2018-11-10 12:13:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:13:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 12:13:44,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 12:13:44,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:44,606 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:13:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:44,660 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 [2018-11-10 12:13:44,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 12:13:44,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 12:13:44,688 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 [2018-11-10 12:13:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:13:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 12:13:44,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 12:13:44,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:44,689 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:13:44,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:44,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:44,725 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 [2018-11-10 12:13:44,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 12:13:44,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 136 states and 154 transitions. Complement of second has 6 states. [2018-11-10 12:13:44,752 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 [2018-11-10 12:13:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:13:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-10 12:13:44,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 12:13:44,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:44,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 12:13:44,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:44,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 12:13:44,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:13:44,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 154 transitions. [2018-11-10 12:13:44,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:13:44,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 0 states and 0 transitions. [2018-11-10 12:13:44,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:13:44,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:13:44,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:13:44,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:13:44,756 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:13:44,756 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:13:44,756 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:13:44,756 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:13:44,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:13:44,756 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:13:44,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:13:44,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:13:44 BoogieIcfgContainer [2018-11-10 12:13:44,762 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:13:44,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:13:44,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:13:44,763 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:13:44,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:41" (3/4) ... [2018-11-10 12:13:44,766 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:13:44,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:13:44,767 INFO L168 Benchmark]: Toolchain (without parser) took 3954.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 956.4 MB in the beginning and 823.0 MB in the end (delta: 133.4 MB). Peak memory consumption was 352.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:44,767 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:13:44,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.03 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:44,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:44,769 INFO L168 Benchmark]: Boogie Preprocessor took 19.49 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. [2018-11-10 12:13:44,769 INFO L168 Benchmark]: RCFGBuilder took 247.13 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: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:44,769 INFO L168 Benchmark]: BuchiAutomizer took 3333.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 291.0 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:44,770 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.2 GB. Free memory is still 823.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:13:44,774 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.03 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.49 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 247.13 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: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3333.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 291.0 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.2 GB. Free memory is still 823.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[numbers] + -1 * numbers + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 144 SDtfs, 223 SDslu, 124 SDs, 0 SdLazy, 201 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax158 hnf98 lsp66 ukn97 mio100 lsp77 div100 bol100 ite100 ukn100 eq172 hnf90 smp90 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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...