./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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 32bit --witnessprinter.graph.data.programhash c685955ff6c809f32f6abe44f773ce6a6ae39f94 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:22:19,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:22:19,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:22:19,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:22:19,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:22:19,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:22:19,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:22:19,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:22:19,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:22:19,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:22:19,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:22:19,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:22:19,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:22:19,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:22:19,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:22:19,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:22:19,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:22:19,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:22:19,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:22:19,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:22:19,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:22:19,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:22:19,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:22:19,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:22:19,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:22:19,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:22:19,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:22:19,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:22:19,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:22:19,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:22:19,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:22:19,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:22:19,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:22:19,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:22:19,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:22:19,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:22:19,473 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:22:19,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:22:19,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:22:19,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:22:19,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:22:19,484 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:22:19,485 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:22:19,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:22:19,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:22:19,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:22:19,490 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:22:19,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:22:19,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:22:19,491 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:22:19,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:22:19,492 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_81b54774-2a54-4d1e-9cd8-8ed1498da772/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c685955ff6c809f32f6abe44f773ce6a6ae39f94 [2018-11-18 12:22:19,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:22:19,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:22:19,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:22:19,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:22:19,523 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:22:19,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:22:19,558 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/data/1d28055fd/bd90ddf651db4783874ab42afb2eef7f/FLAGe4fbaf403 [2018-11-18 12:22:19,985 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:22:19,986 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:22:19,992 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/data/1d28055fd/bd90ddf651db4783874ab42afb2eef7f/FLAGe4fbaf403 [2018-11-18 12:22:20,002 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/bin-2019/uautomizer/data/1d28055fd/bd90ddf651db4783874ab42afb2eef7f [2018-11-18 12:22:20,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:22:20,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:22:20,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:22:20,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:22:20,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:22:20,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d276455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20, skipping insertion in model container [2018-11-18 12:22:20,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:22:20,046 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:22:20,223 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:22:20,231 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:22:20,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:22:20,334 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:22:20,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20 WrapperNode [2018-11-18 12:22:20,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:22:20,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:22:20,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:22:20,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:22:20,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:22:20,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:22:20,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:22:20,363 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:22:20,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... [2018-11-18 12:22:20,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:22:20,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:22:20,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:22:20,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:22:20,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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-18 12:22:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:22:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:22:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:22:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:22:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:22:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:22:20,588 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:22:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:20 BoogieIcfgContainer [2018-11-18 12:22:20,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:22:20,589 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:22:20,589 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:22:20,593 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:22:20,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:22:20,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:22:20" (1/3) ... [2018-11-18 12:22:20,595 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569da622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:22:20, skipping insertion in model container [2018-11-18 12:22:20,595 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:22:20,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:20" (2/3) ... [2018-11-18 12:22:20,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569da622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:22:20, skipping insertion in model container [2018-11-18 12:22:20,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:22:20,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:20" (3/3) ... [2018-11-18 12:22:20,598 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:22:20,652 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:22:20,652 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:22:20,653 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:22:20,653 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:22:20,653 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:22:20,653 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:22:20,653 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:22:20,653 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:22:20,653 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:22:20,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:22:20,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:22:20,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:20,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:20,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:22:20,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:20,699 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:22:20,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 12:22:20,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:22:20,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:20,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:20,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:22:20,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:20,710 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#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; 4#L555true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L555-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 15#L543-4true [2018-11-18 12:22:20,710 INFO L796 eck$LassoCheckResult]: Loop: 15#L543-4true assume true; 8#L543-1true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 12#L544-4true assume !true; 13#L543-3true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 15#L543-4true [2018-11-18 12:22:20,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:20,716 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 12:22:20,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:20,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:20,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:20,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1329256, now seen corresponding path program 1 times [2018-11-18 12:22:20,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:20,863 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-18 12:22:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:20,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:22:20,868 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:22:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:22:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:22:20,881 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-18 12:22:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:20,886 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-18 12:22:20,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:22:20,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-18 12:22:20,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:22:20,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-11-18 12:22:20,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:22:20,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:22:20,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 12:22:20,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:22:20,893 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:22:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 12:22:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 12:22:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 12:22:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 12:22:20,917 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:22:20,917 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 12:22:20,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:22:20,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 12:22:20,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:22:20,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:20,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:20,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:22:20,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:22:20,919 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#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; 39#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L555-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 41#L543-4 [2018-11-18 12:22:20,919 INFO L796 eck$LassoCheckResult]: Loop: 41#L543-4 assume true; 42#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 43#L544-4 assume true; 47#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 46#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 41#L543-4 [2018-11-18 12:22:20,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 12:22:20,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:20,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 41193117, now seen corresponding path program 1 times [2018-11-18 12:22:20,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1181924665, now seen corresponding path program 1 times [2018-11-18 12:22:20,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,018 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:22:21,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:22:21,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:22:21,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:22:21,019 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:22:21,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:22:21,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:22:21,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:22:21,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-18 12:22:21,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:22:21,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:22:21,035 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-18 12:22:21,040 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-18 12:22:21,119 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:22:21,120 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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-18 12:22:21,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:22:21,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:22:21,137 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:22:21,138 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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-18 12:22:21,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:22:21,168 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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-18 12:22:21,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:22:21,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:22:21,213 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:22:21,214 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:22:21,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:22:21,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:22:21,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:22:21,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:22:21,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:22:21,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:22:21,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:22:21,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-18 12:22:21,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:22:21,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:22:21,216 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-18 12:22:21,218 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-18 12:22:21,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:22:21,305 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:22:21,307 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-18 12:22:21,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:21,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:21,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:21,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:21,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:21,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:21,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:21,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:21,314 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-18 12:22:21,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:21,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:21,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:21,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:21,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:21,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:21,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:21,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:22:21,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:22:21,328 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:22:21,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:22:21,330 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:22:21,330 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:22:21,331 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2018-11-18 12:22:21,332 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:22:21,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:21,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:21,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:21,433 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-18 12:22:21,436 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-18 12:22:21,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 12:22:21,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-11-18 12:22:21,480 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-18 12:22:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:22:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 12:22:21,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-18 12:22:21,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:21,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-18 12:22:21,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:21,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 12:22:21,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:21,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-18 12:22:21,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:21,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2018-11-18 12:22:21,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 12:22:21,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 12:22:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-18 12:22:21,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:22:21,486 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 12:22:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-18 12:22:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 12:22:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 12:22:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-18 12:22:21,488 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 12:22:21,488 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 12:22:21,488 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:22:21,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-18 12:22:21,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:21,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:21,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:21,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:22:21,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:21,490 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 117#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; 118#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 119#L555-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 120#L543-4 assume true; 121#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 122#L544-4 [2018-11-18 12:22:21,490 INFO L796 eck$LassoCheckResult]: Loop: 122#L544-4 assume true; 128#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 132#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 126#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 122#L544-4 [2018-11-18 12:22:21,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 12:22:21,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:21,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 1 times [2018-11-18 12:22:21,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2015039279, now seen corresponding path program 1 times [2018-11-18 12:22:21,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:21,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:21,728 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:22:21,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:22:21,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:22:21,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:22:21,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:22:21,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:22:21,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:22:21,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:22:21,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 12:22:21,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:22:21,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:22:21,735 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-18 12:22:21,871 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-18 12:22:21,879 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-18 12:22:21,881 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-18 12:22:21,883 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-18 12:22:21,884 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-18 12:22:21,887 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-18 12:22:21,888 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-18 12:22:21,890 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-18 12:22:21,892 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-18 12:22:21,894 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-18 12:22:21,896 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-18 12:22:22,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:22:22,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:22:22,126 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-18 12:22:22,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:22,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:22,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:22,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:22,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:22:22,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:22:22,169 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:22:22,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:22:22,192 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:22:22,192 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:22:22,195 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:22:22,195 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:22:22,196 INFO L520 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-18 12:22:22,239 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 12:22:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:22,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:22,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:22,285 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-18 12:22:22,285 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-18 12:22:22,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 12:22:22,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 42 states and 55 transitions. Complement of second has 7 states. [2018-11-18 12:22:22,312 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-18 12:22:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:22:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:22:22,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 12:22:22,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:22,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 12:22:22,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:22,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 12:22:22,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:22,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 55 transitions. [2018-11-18 12:22:22,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 27 states and 35 transitions. [2018-11-18 12:22:22,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:22:22,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 12:22:22,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-18 12:22:22,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:22:22,317 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-18 12:22:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-18 12:22:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-18 12:22:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 12:22:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-18 12:22:22,319 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 12:22:22,319 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 12:22:22,319 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:22:22,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-18 12:22:22,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:22,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:22,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:22:22,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:22,320 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 246#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; 247#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 248#L555-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 249#L543-4 assume true; 252#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 253#L544-4 assume true; 265#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 260#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 261#L543-4 assume true; 250#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 251#L544-4 [2018-11-18 12:22:22,320 INFO L796 eck$LassoCheckResult]: Loop: 251#L544-4 assume true; 257#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 262#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 255#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 251#L544-4 [2018-11-18 12:22:22,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1958237342, now seen corresponding path program 2 times [2018-11-18 12:22:22,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:22,352 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-18 12:22:22,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:22,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:22:22,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:22:22,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 2 times [2018-11-18 12:22:22,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:22,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:22,411 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 12:22:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:22,437 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-18 12:22:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:22:22,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-18 12:22:22,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 45 transitions. [2018-11-18 12:22:22,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:22:22,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:22:22,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2018-11-18 12:22:22,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:22:22,440 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-18 12:22:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2018-11-18 12:22:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-11-18 12:22:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 12:22:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-18 12:22:22,441 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 12:22:22,442 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 12:22:22,442 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:22:22,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-18 12:22:22,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:22,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:22,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:22:22,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:22,443 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#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; 323#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 324#L555-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 325#L543-4 assume true; 341#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 335#L544-4 assume true; 336#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 340#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 332#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 333#L544-4 assume true; 342#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 337#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 338#L543-4 assume true; 326#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 327#L544-4 [2018-11-18 12:22:22,443 INFO L796 eck$LassoCheckResult]: Loop: 327#L544-4 assume true; 334#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 339#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 331#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 327#L544-4 [2018-11-18 12:22:22,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1305175541, now seen corresponding path program 1 times [2018-11-18 12:22:22,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 3 times [2018-11-18 12:22:22,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash 219663612, now seen corresponding path program 1 times [2018-11-18 12:22:22,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:22,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:22:22,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81b54774-2a54-4d1e-9cd8-8ed1498da772/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-18 12:22:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:22,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:22:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 12:22:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:22:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:22:22,643 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 12 states. [2018-11-18 12:22:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:22,722 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-18 12:22:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:22:22,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 70 transitions. [2018-11-18 12:22:22,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 47 states and 60 transitions. [2018-11-18 12:22:22,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:22:22,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:22:22,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-11-18 12:22:22,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:22:22,727 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-18 12:22:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-11-18 12:22:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-18 12:22:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:22:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-18 12:22:22,730 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:22:22,730 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:22:22,730 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:22:22,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2018-11-18 12:22:22,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 12:22:22,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:22:22,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:22:22,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:22:22,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:22:22,731 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 482#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; 483#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 484#L555-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);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; 485#L543-4 assume true; 488#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 489#L544-4 assume true; 507#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 506#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 492#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 493#L544-4 assume true; 497#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 499#L545 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 500#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 505#L544-4 assume true; 502#L544-1 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 494#L543-3 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 495#L543-4 assume true; 486#L543-1 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 487#L544-4 [2018-11-18 12:22:22,731 INFO L796 eck$LassoCheckResult]: Loop: 487#L544-4 assume true; 496#L544-1 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 498#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 491#L544-3 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 487#L544-4 [2018-11-18 12:22:22,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1505227724, now seen corresponding path program 2 times [2018-11-18 12:22:22,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1605896, now seen corresponding path program 4 times [2018-11-18 12:22:22,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash 298555219, now seen corresponding path program 2 times [2018-11-18 12:22:22,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:22:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:22:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:22:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:23,080 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2018-11-18 12:22:23,132 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:22:23,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:22:23,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:22:23,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:22:23,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:22:23,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:22:23,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:22:23,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:22:23,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 12:22:23,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:22:23,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:22:23,136 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-18 12:22:23,137 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-18 12:22:23,139 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-18 12:22:23,140 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-18 12:22:23,141 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-18 12:22:23,143 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-18 12:22:23,144 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-18 12:22:23,262 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-18 12:22:23,263 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-18 12:22:23,264 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-18 12:22:23,265 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-18 12:22:23,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:22:23,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:22:23,410 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-18 12:22:23,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:23,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:23,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:23,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,413 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-18 12:22:23,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:23,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:23,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:23,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,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-18 12:22:23,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:23,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:23,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:23,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,424 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-18 12:22:23,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:22:23,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:22:23,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,427 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-18 12:22:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:23,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:23,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:23,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,429 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-18 12:22:23,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:22:23,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:22:23,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:22:23,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:22:23,431 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-18 12:22:23,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:22:23,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:22:23,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:22:23,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:22:23,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:22:23,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:22:23,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:22:23,456 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:22:23,456 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:22:23,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:22:23,457 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:22:23,457 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:22:23,457 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2, ULTIMATE.start_bubbleSort_~j~0) = -1*ULTIMATE.start_bubbleSort_~numbers.offset + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2018-11-18 12:22:23,474 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 12:22:23,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:22:23,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,510 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-18 12:22:23,510 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-18 12:22:23,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:22:23,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 49 states and 62 transitions. Complement of second has 7 states. [2018-11-18 12:22:23,522 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-18 12:22:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:22:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:22:23,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:22:23,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:23,523 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:22:23,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,549 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-18 12:22:23,549 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-18 12:22:23,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:22:23,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 49 states and 62 transitions. Complement of second has 7 states. [2018-11-18 12:22:23,566 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-18 12:22:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:22:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 12:22:23,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:22:23,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:23,567 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:22:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:23,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:23,593 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-18 12:22:23,593 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-18 12:22:23,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 12:22:23,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 74 transitions. Complement of second has 6 states. [2018-11-18 12:22:23,604 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-18 12:22:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:22:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-18 12:22:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 12:22:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-18 12:22:23,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:23,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-18 12:22:23,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:22:23,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 74 transitions. [2018-11-18 12:22:23,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:22:23,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:22:23,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:22:23,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:22:23,606 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:22:23,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:22:23,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:22:23,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:22:23,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:22:23 BoogieIcfgContainer [2018-11-18 12:22:23,610 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:22:23,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:22:23,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:22:23,611 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:22:23,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:20" (3/4) ... [2018-11-18 12:22:23,613 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:22:23,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:22:23,614 INFO L168 Benchmark]: Toolchain (without parser) took 3609.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -198.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:23,614 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:23,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:23,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:23,615 INFO L168 Benchmark]: Boogie Preprocessor took 15.55 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:23,616 INFO L168 Benchmark]: RCFGBuilder took 210.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:23,616 INFO L168 Benchmark]: BuchiAutomizer took 3021.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:23,617 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:23,619 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.55 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3021.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 -1 * numbers + unknown-#length-unknown[numbers] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.3s. 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, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 103 SDslu, 84 SDs, 0 SdLazy, 117 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf96 lsp98 ukn83 mio100 lsp81 div100 bol100 ite100 ukn100 eq168 hnf91 smp89 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 69ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...