./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/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 b59596f519f075436dc724f37897dcc3b0f74afa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:31:34,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:31:34,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:31:34,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:31:34,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:31:34,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:31:34,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:31:34,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:31:34,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:31:34,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:31:34,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:31:34,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:31:34,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:31:34,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:31:34,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:31:34,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:31:34,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:31:34,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:31:34,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:31:34,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:31:34,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:31:34,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:31:34,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:31:34,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:31:34,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:31:34,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:31:34,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:31:34,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:31:34,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:31:34,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:31:34,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:31:34,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:31:34,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:31:34,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:31:34,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:31:34,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:31:34,906 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:31:34,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:31:34,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:31:34,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:31:34,915 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:31:34,915 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:31:34,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:31:34,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:31:34,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:31:34,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:31:34,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:31:34,918 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:31:34,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:31:34,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:31:34,918 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:31:34,919 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:31:34,919 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_c9880d20-e0bb-4e80-9074-55efab63f128/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 -> b59596f519f075436dc724f37897dcc3b0f74afa [2018-11-23 13:31:34,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:31:34,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:31:34,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:31:34,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:31:34,951 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:31:34,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/../../sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-11-23 13:31:34,986 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/data/01e4adb18/8d66746ac3764320ae8e8f35738a92ff/FLAG65d1ec1d7 [2018-11-23 13:31:35,391 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:31:35,391 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-11-23 13:31:35,395 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/data/01e4adb18/8d66746ac3764320ae8e8f35738a92ff/FLAG65d1ec1d7 [2018-11-23 13:31:35,403 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/data/01e4adb18/8d66746ac3764320ae8e8f35738a92ff [2018-11-23 13:31:35,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:31:35,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:31:35,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:31:35,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:31:35,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:31:35,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3436f9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35, skipping insertion in model container [2018-11-23 13:31:35,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:31:35,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:31:35,566 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:31:35,571 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:31:35,591 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:31:35,601 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:31:35,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35 WrapperNode [2018-11-23 13:31:35,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:31:35,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:31:35,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:31:35,602 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:31:35,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:31:35,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:31:35,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:31:35,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:31:35,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... [2018-11-23 13:31:35,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:31:35,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:31:35,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:31:35,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:31:35,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/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-23 13:31:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:31:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:31:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:31:35,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:31:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:31:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:31:35,962 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:31:35,962 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 13:31:35,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:31:35 BoogieIcfgContainer [2018-11-23 13:31:35,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:31:35,963 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:31:35,963 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:31:35,966 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:31:35,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:31:35,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:31:35" (1/3) ... [2018-11-23 13:31:35,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53478945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:31:35, skipping insertion in model container [2018-11-23 13:31:35,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:31:35,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:31:35" (2/3) ... [2018-11-23 13:31:35,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53478945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:31:35, skipping insertion in model container [2018-11-23 13:31:35,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:31:35,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:31:35" (3/3) ... [2018-11-23 13:31:35,973 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubble_sort_true-unreach-call_true-termination.i [2018-11-23 13:31:36,009 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:31:36,010 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:31:36,010 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:31:36,010 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:31:36,010 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:31:36,010 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:31:36,010 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:31:36,010 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:31:36,010 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:31:36,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 13:31:36,033 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2018-11-23 13:31:36,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:36,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:36,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:31:36,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:36,037 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:31:36,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 13:31:36,039 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2018-11-23 13:31:36,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:36,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:36,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:31:36,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:36,044 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 23#L55true assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 4#L62true assume q1_#t~switch13;q1_~i~1 := 0; 15#L63-3true [2018-11-23 13:31:36,044 INFO L796 eck$LassoCheckResult]: Loop: 15#L63-3true assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 16#L63-2true q1_#t~pre14 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre14; 15#L63-3true [2018-11-23 13:31:36,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-11-23 13:31:36,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:36,133 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-23 13:31:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:36,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:31:36,137 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:31:36,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2018-11-23 13:31:36,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:31:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:31:36,226 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-11-23 13:31:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:36,251 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-11-23 13:31:36,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:31:36,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-23 13:31:36,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:31:36,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2018-11-23 13:31:36,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:31:36,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:31:36,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-23 13:31:36,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:36,259 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-23 13:31:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-23 13:31:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-23 13:31:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:31:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-23 13:31:36,277 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 13:31:36,277 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 13:31:36,277 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:31:36,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-23 13:31:36,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 13:31:36,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:36,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:36,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:31:36,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:36,279 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 69#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 66#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 67#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 72#L68 assume q1_#t~switch13;q1_~i~1 := 0; 75#L69-3 [2018-11-23 13:31:36,279 INFO L796 eck$LassoCheckResult]: Loop: 75#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 76#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 75#L69-3 [2018-11-23 13:31:36,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2018-11-23 13:31:36,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2018-11-23 13:31:36,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2018-11-23 13:31:36,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:36,482 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-23 13:31:36,536 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:31:36,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:31:36,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:31:36,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:31:36,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:31:36,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:31:36,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:31:36,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:31:36,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-23 13:31:36,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:31:36,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:31:36,552 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-23 13:31:36,588 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-23 13:31:36,590 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-23 13:31:36,592 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-23 13:31:36,604 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-23 13:31:36,606 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-23 13:31:36,608 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-23 13:31:36,610 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-23 13:31:36,613 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-23 13:31:36,614 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-23 13:31:36,625 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-23 13:31:36,626 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-23 13:31:36,635 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-23 13:31:36,637 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-23 13:31:36,639 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-23 13:31:36,644 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-23 13:31:36,645 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-23 13:31:36,646 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-23 13:31:36,804 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:31:36,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:31:36,809 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-23 13:31:36,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:36,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:31:36,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:31:36,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:36,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:31:36,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:31:36,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:31:36,859 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:31:36,859 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:31:36,861 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:31:36,863 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:31:36,864 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:31:36,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1, ULTIMATE.start_q1_~#a~1.offset, ULTIMATE.start_q1_~i~1) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1 - 1*ULTIMATE.start_q1_~#a~1.offset - 4*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2018-11-23 13:31:36,877 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 13:31:36,881 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:31:36,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:36,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:36,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:36,927 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-23 13:31:36,930 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-23 13:31:36,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 13:31:36,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2018-11-23 13:31:36,955 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-23 13:31:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:31:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-23 13:31:36,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 13:31:36,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:36,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 13:31:36,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:36,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 13:31:36,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:36,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2018-11-23 13:31:36,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 13:31:36,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-11-23 13:31:36,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:31:36,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 13:31:36,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-11-23 13:31:36,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:36,962 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-11-23 13:31:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-11-23 13:31:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-11-23 13:31:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:31:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-11-23 13:31:36,963 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 13:31:36,963 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-23 13:31:36,963 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:31:36,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-11-23 13:31:36,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:31:36,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:36,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:36,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:36,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:31:36,965 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 167#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 164#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 165#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 172#L68 assume !q1_#t~switch13; 163#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 159#L17-3 [2018-11-23 13:31:36,965 INFO L796 eck$LassoCheckResult]: Loop: 159#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 160#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 158#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 159#L17-3 [2018-11-23 13:31:36,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2018-11-23 13:31:36,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:36,977 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-23 13:31:36,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:36,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:31:36,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:31:36,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:36,978 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2018-11-23 13:31:36,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:36,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:36,988 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-23 13:31:36,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:31:36,989 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:31:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:31:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:31:36,990 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 13:31:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:37,000 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-11-23 13:31:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:31:37,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-23 13:31:37,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2018-11-23 13:31:37,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 13:31:37,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 13:31:37,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-23 13:31:37,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:37,003 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:31:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-23 13:31:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:31:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:31:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-23 13:31:37,005 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:31:37,005 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:31:37,005 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:31:37,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-23 13:31:37,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:37,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:37,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,007 INFO L794 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 214#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 211#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 212#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 219#L68 assume !q1_#t~switch13; 210#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 205#L17-3 [2018-11-23 13:31:37,007 INFO L796 eck$LassoCheckResult]: Loop: 205#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 206#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 207#L22 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 208#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 209#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 204#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 205#L17-3 [2018-11-23 13:31:37,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2018-11-23 13:31:37,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,022 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-23 13:31:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:31:37,023 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:31:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2018-11-23 13:31:37,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:31:37,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:37,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:31:37,032 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:31:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:31:37,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:31:37,032 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 13:31:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:37,039 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-11-23 13:31:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:31:37,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-23 13:31:37,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2018-11-23 13:31:37,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:31:37,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:31:37,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-23 13:31:37,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:37,041 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 13:31:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-23 13:31:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 13:31:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:31:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-23 13:31:37,043 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 13:31:37,043 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 13:31:37,043 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:31:37,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-23 13:31:37,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:37,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:37,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,045 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 262#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 259#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 260#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 265#L68 assume !q1_#t~switch13; 258#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 253#L17-3 [2018-11-23 13:31:37,045 INFO L796 eck$LassoCheckResult]: Loop: 253#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 254#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 255#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 264#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 256#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 257#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 252#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 253#L17-3 [2018-11-23 13:31:37,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2018-11-23 13:31:37,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,060 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-23 13:31:37,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:37,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:31:37,061 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:31:37,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2018-11-23 13:31:37,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:37,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:31:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:31:37,176 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 13:31:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:37,181 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-11-23 13:31:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:31:37,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-11-23 13:31:37,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 13:31:37,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 13:31:37,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 13:31:37,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-23 13:31:37,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:37,183 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 13:31:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-23 13:31:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:31:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:31:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 13:31:37,185 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 13:31:37,185 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 13:31:37,185 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:31:37,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-23 13:31:37,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:37,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:37,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:37,186 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 308#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 305#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 306#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 311#L68 assume q1_#t~switch13;q1_~i~1 := 0; 314#L69-3 assume !(q1_~i~1 < q1_~N~0); 312#L69-4 q1_~i~1 := 0; 313#L70-3 [2018-11-23 13:31:37,186 INFO L796 eck$LassoCheckResult]: Loop: 313#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 317#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 313#L70-3 [2018-11-23 13:31:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2018-11-23 13:31:37,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2018-11-23 13:31:37,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,198 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:37,198 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:37,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2018-11-23 13:31:37,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,249 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:37,249 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:37,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:37,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:37,320 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-23 13:31:37,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:37,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:31:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:31:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:31:37,408 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 13:31:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:37,446 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 13:31:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:31:37,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2018-11-23 13:31:37,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-11-23 13:31:37,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2018-11-23 13:31:37,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 13:31:37,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 13:31:37,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2018-11-23 13:31:37,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:37,450 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-23 13:31:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2018-11-23 13:31:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-11-23 13:31:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:31:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 13:31:37,452 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 13:31:37,452 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 13:31:37,452 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:31:37,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 13:31:37,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:37,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:37,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,453 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 409#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 410#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 407#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 408#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 413#L68 assume q1_#t~switch13;q1_~i~1 := 0; 416#L69-3 assume !(q1_~i~1 < q1_~N~0); 414#L69-4 q1_~i~1 := 0; 415#L70-3 assume !(q1_~i~1 < q1_~N~0); 406#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 401#L17-3 [2018-11-23 13:31:37,453 INFO L796 eck$LassoCheckResult]: Loop: 401#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 402#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 403#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 412#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 404#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 405#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 400#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 401#L17-3 [2018-11-23 13:31:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2018-11-23 13:31:37,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2018-11-23 13:31:37,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2018-11-23 13:31:37,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:31:37,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:31:37,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:31:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:31:37,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:31:37,643 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 13:31:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:37,707 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:31:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:31:37,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-23 13:31:37,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 27 transitions. [2018-11-23 13:31:37,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 13:31:37,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:31:37,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-23 13:31:37,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:37,709 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 13:31:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-23 13:31:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 13:31:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:31:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 13:31:37,711 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 13:31:37,711 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 13:31:37,711 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:31:37,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:31:37,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:37,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:37,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:37,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:37,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:37,712 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 475#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 476#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 473#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 474#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 479#L68 assume q1_#t~switch13;q1_~i~1 := 0; 482#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 483#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 484#L69-3 assume !(q1_~i~1 < q1_~N~0); 480#L69-4 q1_~i~1 := 0; 481#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 485#L70-2 [2018-11-23 13:31:37,712 INFO L796 eck$LassoCheckResult]: Loop: 485#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 486#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 485#L70-2 [2018-11-23 13:31:37,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2018-11-23 13:31:37,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,716 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:37,717 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:37,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:37,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2018-11-23 13:31:37,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:37,780 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:37,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:37,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:31:37,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:31:37,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:37,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2018-11-23 13:31:37,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:37,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:37,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:37,833 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:37,833 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:37,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:37,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:37,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:31:37,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:31:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 13:31:37,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:31:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:31:37,994 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-23 13:31:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:38,043 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 13:31:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:31:38,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2018-11-23 13:31:38,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-11-23 13:31:38,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 13:31:38,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 13:31:38,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 13:31:38,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-11-23 13:31:38,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:31:38,045 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 13:31:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-11-23 13:31:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2018-11-23 13:31:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:31:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 13:31:38,047 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 13:31:38,047 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 13:31:38,047 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:31:38,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-23 13:31:38,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 13:31:38,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:38,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:38,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:38,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:31:38,048 INFO L794 eck$LassoCheckResult]: Stem: 599#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 597#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 598#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 595#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 596#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 601#L68 assume q1_#t~switch13;q1_~i~1 := 0; 604#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 605#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 606#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 607#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 614#L69-3 assume !(q1_~i~1 < q1_~N~0); 613#L69-4 q1_~i~1 := 0; 608#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 609#L70-2 [2018-11-23 13:31:38,048 INFO L796 eck$LassoCheckResult]: Loop: 609#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 610#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 609#L70-2 [2018-11-23 13:31:38,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2018-11-23 13:31:38,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,053 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:38,053 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:38,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:31:38,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:31:38,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:38,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2018-11-23 13:31:38,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:38,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:38,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,106 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:38,106 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:38,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:38,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:31:38,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 13:31:38,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:38,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2018-11-23 13:31:38,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:38,147 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:38,147 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:38,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:38,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:31:38,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:31:38,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:38,675 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2018-11-23 13:31:39,100 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-11-23 13:31:39,110 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:31:39,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:31:39,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:31:39,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:31:39,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:31:39,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:31:39,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:31:39,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:31:39,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 13:31:39,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:31:39,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:31:39,115 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-23 13:31:39,121 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-23 13:31:39,126 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-23 13:31:39,370 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-23 13:31:39,371 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-23 13:31:39,372 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-23 13:31:39,373 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-23 13:31:39,374 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-23 13:31:39,375 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-23 13:31:39,376 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-23 13:31:39,378 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-23 13:31:39,382 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-23 13:31:39,383 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-23 13:31:39,385 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-23 13:31:39,386 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-23 13:31:39,530 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-11-23 13:31:44,007 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-11-23 13:31:58,043 WARN L180 SmtUtils]: Spent 13.92 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-23 13:31:58,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:31:58,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:31:58,083 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-23 13:31:58,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:58,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:31:58,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:31:58,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:31:58,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:58,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:31:58,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:31:58,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:31:58,086 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-23 13:31:58,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:58,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:31:58,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:31:58,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:58,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:31:58,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:31:58,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:31:58,092 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-23 13:31:58,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:58,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:31:58,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:31:58,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:58,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:31:58,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:31:58,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:31:58,096 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-23 13:31:58,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:58,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:31:58,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:31:58,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:58,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:31:58,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:31:58,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:31:58,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:31:58,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:31:58,106 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:31:58,106 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 13:31:58,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:31:58,118 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2018-11-23 13:31:58,118 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 13:31:58,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:31:58,370 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 13:31:58,370 INFO L444 ModelExtractionUtils]: 40 out of 50 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 13:31:58,371 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:31:58,372 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-23 13:31:58,372 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:31:58,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~N~0, ULTIMATE.start_q1_~i~1) = 1*ULTIMATE.start_q1_~N~0 - 1*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2018-11-23 13:31:58,384 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 13:31:58,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:58,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:58,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:58,426 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-23 13:31:58,427 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-23 13:31:58,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 13:31:58,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 38 states and 48 transitions. Complement of second has 4 states. [2018-11-23 13:31:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:31:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:31:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-23 13:31:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-23 13:31:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-23 13:31:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-23 13:31:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:31:58,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2018-11-23 13:31:58,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 13:31:58,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2018-11-23 13:31:58,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 13:31:58,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:31:58,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2018-11-23 13:31:58,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:31:58,444 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 13:31:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2018-11-23 13:31:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 13:31:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:31:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 13:31:58,445 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 13:31:58,445 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 13:31:58,445 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:31:58,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-23 13:31:58,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 13:31:58,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:58,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:58,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:58,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:58,447 INFO L794 eck$LassoCheckResult]: Stem: 737#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 735#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 736#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 733#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 734#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 739#L68 assume q1_#t~switch13;q1_~i~1 := 0; 742#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 743#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 753#L69-3 assume !(q1_~i~1 < q1_~N~0); 752#L69-4 q1_~i~1 := 0; 751#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 749#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 750#L70-3 assume !(q1_~i~1 < q1_~N~0); 732#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 727#L17-3 [2018-11-23 13:31:58,447 INFO L796 eck$LassoCheckResult]: Loop: 727#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 728#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 729#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 738#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 730#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 731#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 726#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 727#L17-3 [2018-11-23 13:31:58,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2018-11-23 13:31:58,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:58,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:58,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2018-11-23 13:31:58,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,517 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2018-11-23 13:31:58,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,519 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:58,519 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:58,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:58,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:31:58,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:31:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:31:58,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:31:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 13:31:58,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:31:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:31:58,655 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 13:31:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:31:58,696 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 13:31:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:31:58,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-11-23 13:31:58,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 13:31:58,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2018-11-23 13:31:58,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:31:58,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:31:58,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-11-23 13:31:58,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:31:58,698 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 13:31:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-11-23 13:31:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 13:31:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:31:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 13:31:58,699 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 13:31:58,699 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 13:31:58,699 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:31:58,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:31:58,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 13:31:58,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:31:58,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:31:58,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:58,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:31:58,700 INFO L794 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 876#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 873#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 874#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 881#L68 assume q1_#t~switch13;q1_~i~1 := 0; 882#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 883#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 884#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 885#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 890#L69-3 assume !(q1_~i~1 < q1_~N~0); 879#L69-4 q1_~i~1 := 0; 880#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 886#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 887#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 888#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 889#L70-3 assume !(q1_~i~1 < q1_~N~0); 872#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 867#L17-3 [2018-11-23 13:31:58,700 INFO L796 eck$LassoCheckResult]: Loop: 867#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 868#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 869#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 878#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 870#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 871#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 866#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 867#L17-3 [2018-11-23 13:31:58,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2018-11-23 13:31:58,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:31:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,704 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:58,704 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:58,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:31:58,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:31:58,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2018-11-23 13:31:58,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:31:58,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:31:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2018-11-23 13:31:58,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:31:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:31:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:31:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:31:58,775 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:31:58,775 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:31:58,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:31:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:31:58,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:31:58,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:31:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:00,106 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 204 DAG size of output: 178 [2018-11-23 13:32:02,001 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 216 DAG size of output: 121 [2018-11-23 13:32:02,004 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:32:02,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:32:02,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:32:02,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:32:02,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:32:02,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:02,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:32:02,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:32:02,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration11_Lasso [2018-11-23 13:32:02,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:32:02,005 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:32:02,009 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-23 13:32:02,013 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-23 13:32:02,015 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-23 13:32:02,017 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-23 13:32:02,018 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-23 13:32:02,018 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-23 13:32:02,019 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-23 13:32:02,024 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-23 13:32:02,025 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-23 13:32:02,026 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-23 13:32:02,026 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-23 13:32:02,027 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-23 13:32:02,029 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-23 13:32:02,030 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-23 13:32:02,030 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-23 13:32:02,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-23 13:32:02,318 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-11-23 13:32:02,385 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-23 13:32:02,386 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-23 13:32:02,388 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-23 13:32:02,392 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-23 13:32:02,393 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-23 13:32:02,394 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-23 13:32:02,806 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-11-23 13:32:02,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:32:02,865 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:32:02,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,874 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-23 13:32:02,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:02,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,878 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-23 13:32:02,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:02,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,887 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-23 13:32:02,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,888 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-23 13:32:02,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,892 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-23 13:32:02,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:02,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,896 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-23 13:32:02,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:02,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:02,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:02,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,898 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-23 13:32:02,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:02,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,902 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-23 13:32:02,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:02,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:02,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:02,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:02,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:02,906 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:32:02,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:02,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:02,909 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:32:02,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:02,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:32:02,946 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:32:02,946 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:32:02,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:32:02,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:32:02,948 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:32:02,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~size) = -1*ULTIMATE.start_bubblesort_~a~0 + 1*ULTIMATE.start_bubblesort_~size Supporting invariants [] [2018-11-23 13:32:03,029 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 13:32:03,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:03,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:03,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:32:03,086 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-23 13:32:03,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:32:03,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 4 states. [2018-11-23 13:32:03,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:32:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:32:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:32:03,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-23 13:32:03,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:03,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2018-11-23 13:32:03,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:03,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2018-11-23 13:32:03,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:03,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-23 13:32:03,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:03,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2018-11-23 13:32:03,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 13:32:03,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 13:32:03,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2018-11-23 13:32:03,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:03,128 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 13:32:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2018-11-23 13:32:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:32:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:32:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 13:32:03,130 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 13:32:03,130 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 13:32:03,130 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:32:03,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-11-23 13:32:03,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:03,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:03,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:03,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:03,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:03,131 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1088#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1085#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1086#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1092#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1095#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1096#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1097#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1098#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1103#L69-3 assume !(q1_~i~1 < q1_~N~0); 1093#L69-4 q1_~i~1 := 0; 1094#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1102#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1100#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1101#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1099#L70-3 assume !(q1_~i~1 < q1_~N~0); 1083#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1084#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1076#L19-3 [2018-11-23 13:32:03,131 INFO L796 eck$LassoCheckResult]: Loop: 1076#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1077#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1090#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1080#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1076#L19-3 [2018-11-23 13:32:03,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2018-11-23 13:32:03,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:03,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:03,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:03,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,147 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:03,147 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:03,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:03,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2018-11-23 13:32:03,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:03,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2018-11-23 13:32:03,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:03,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:03,228 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:03,228 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:03,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:03,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:04,604 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 208 DAG size of output: 181 [2018-11-23 13:32:08,971 WARN L180 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 219 DAG size of output: 124 [2018-11-23 13:32:08,973 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:32:08,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:32:08,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:32:08,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:32:08,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:32:08,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:32:08,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:32:08,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:32:08,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-23 13:32:08,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:32:08,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:32:08,977 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-23 13:32:08,982 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-23 13:32:08,983 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-23 13:32:08,992 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-23 13:32:08,993 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-23 13:32:08,994 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-23 13:32:08,996 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-23 13:32:08,997 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-23 13:32:08,998 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-23 13:32:08,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:09,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:09,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:32:09,003 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-23 13:32:09,007 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-23 13:32:09,011 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-23 13:32:09,012 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-23 13:32:09,013 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-23 13:32:09,014 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-23 13:32:09,015 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-23 13:32:09,015 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-23 13:32:09,016 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-23 13:32:09,348 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-11-23 13:32:09,398 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-23 13:32:09,826 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-11-23 13:32:09,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:32:09,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:32:09,863 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-23 13:32:09,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,879 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-23 13:32:09,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,881 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-23 13:32:09,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,883 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-23 13:32:09,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,887 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-23 13:32:09,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,888 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-23 13:32:09,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,892 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-23 13:32:09,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,896 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-23 13:32:09,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,904 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-23 13:32:09,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,909 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-23 13:32:09,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,910 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-23 13:32:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,912 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-23 13:32:09,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,916 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-23 13:32:09,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,919 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-23 13:32:09,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:32:09,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:32:09,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:32:09,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,924 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-23 13:32:09,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:32:09,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:32:09,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:32:09,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:32:09,937 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-23 13:32:09,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:32:09,937 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:32:09,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:32:09,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:32:09,940 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:32:09,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:32:09,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:32:09,989 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 13:32:09,989 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 13:32:09,990 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:32:09,990 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:32:09,991 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:32:09,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~b~0, ULTIMATE.start_bubblesort_~size) = -3*ULTIMATE.start_bubblesort_~a~0 + 2*ULTIMATE.start_bubblesort_~b~0 + 1*ULTIMATE.start_bubblesort_~size Supporting invariants [] [2018-11-23 13:32:10,064 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 13:32:10,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:10,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:10,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:10,106 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-23 13:32:10,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:32:10,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 13:32:10,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 65 transitions. Complement of second has 9 states. [2018-11-23 13:32:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:32:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:32:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 13:32:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-23 13:32:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-23 13:32:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-23 13:32:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:32:10,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2018-11-23 13:32:10,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2018-11-23 13:32:10,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 13:32:10,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 13:32:10,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2018-11-23 13:32:10,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:10,133 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-11-23 13:32:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2018-11-23 13:32:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-11-23 13:32:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:32:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 13:32:10,134 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 13:32:10,134 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 13:32:10,134 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:32:10,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2018-11-23 13:32:10,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:10,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:10,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:10,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:10,136 INFO L794 eck$LassoCheckResult]: Stem: 1322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1320#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1321#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1318#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1319#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1325#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1328#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1329#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1330#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1331#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1336#L69-3 assume !(q1_~i~1 < q1_~N~0); 1326#L69-4 q1_~i~1 := 0; 1327#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1335#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1333#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1334#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1332#L70-3 assume !(q1_~i~1 < q1_~N~0); 1316#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1317#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1311#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1312#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1324#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1314#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1315#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1307#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1308#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1309#L19-3 [2018-11-23 13:32:10,136 INFO L796 eck$LassoCheckResult]: Loop: 1309#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1310#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1323#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1313#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1309#L19-3 [2018-11-23 13:32:10,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2018-11-23 13:32:10,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,139 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:10,139 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:10,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:10,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:10,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:32:10,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:32:10,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 13:32:10,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:10,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2018-11-23 13:32:10,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:32:10,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:32:10,258 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-23 13:32:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:10,326 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:32:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:32:10,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-23 13:32:10,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2018-11-23 13:32:10,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 13:32:10,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 13:32:10,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-23 13:32:10,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:10,328 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 13:32:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-23 13:32:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 13:32:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:32:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 13:32:10,329 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 13:32:10,330 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 13:32:10,330 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 13:32:10,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:32:10,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:10,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:10,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:10,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:10,331 INFO L794 eck$LassoCheckResult]: Stem: 1502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1500#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1501#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1498#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1499#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1505#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1508#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1509#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1520#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1512#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1510#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1511#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1519#L69-3 assume !(q1_~i~1 < q1_~N~0); 1506#L69-4 q1_~i~1 := 0; 1507#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1516#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1517#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1518#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1514#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1515#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1513#L70-3 assume !(q1_~i~1 < q1_~N~0); 1496#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1497#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1491#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1492#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1504#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1494#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1495#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1487#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1488#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1489#L19-3 [2018-11-23 13:32:10,331 INFO L796 eck$LassoCheckResult]: Loop: 1489#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1490#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1503#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1493#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1489#L19-3 [2018-11-23 13:32:10,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2018-11-23 13:32:10,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,335 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:10,335 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:10,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:10,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:10,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:10,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:10,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:32:10,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:32:10,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 13:32:10,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:32:10,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2018-11-23 13:32:10,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:32:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:32:10,469 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-23 13:32:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:10,582 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 13:32:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:32:10,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2018-11-23 13:32:10,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 13:32:10,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 13:32:10,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 13:32:10,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-11-23 13:32:10,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:10,584 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 13:32:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-11-23 13:32:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2018-11-23 13:32:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:32:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 13:32:10,586 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 13:32:10,586 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 13:32:10,586 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 13:32:10,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-11-23 13:32:10,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:10,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:10,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:10,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:10,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:10,587 INFO L794 eck$LassoCheckResult]: Stem: 1693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1691#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1692#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1689#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1690#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1696#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1699#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1700#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1701#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1702#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1704#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1713#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1712#L69-3 assume !(q1_~i~1 < q1_~N~0); 1697#L69-4 q1_~i~1 := 0; 1698#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1709#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1710#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1711#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1706#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1707#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1705#L70-3 assume !(q1_~i~1 < q1_~N~0); 1687#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1688#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1708#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1716#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1703#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1686#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1683#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1684#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1695#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1715#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1714#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1679#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1680#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1681#L19-3 [2018-11-23 13:32:10,587 INFO L796 eck$LassoCheckResult]: Loop: 1681#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1682#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1694#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1685#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1681#L19-3 [2018-11-23 13:32:10,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2018-11-23 13:32:10,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,591 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:10,592 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:10,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:32:10,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:32:10,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:32:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2018-11-23 13:32:10,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:10,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2018-11-23 13:32:10,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:10,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:10,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:10,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:10,699 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:10,699 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:10,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:32:10,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:10,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-23 13:32:10,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:10,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-11-23 13:32:10,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:32:10,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:10,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:10,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2018-11-23 13:32:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:32:10,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:32:10,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-23 13:32:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:32:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:32:10,957 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand 18 states. [2018-11-23 13:32:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:11,258 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2018-11-23 13:32:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:32:11,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 146 transitions. [2018-11-23 13:32:11,259 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 13:32:11,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 146 transitions. [2018-11-23 13:32:11,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-23 13:32:11,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 13:32:11,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2018-11-23 13:32:11,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:11,259 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 146 transitions. [2018-11-23 13:32:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2018-11-23 13:32:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2018-11-23 13:32:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:32:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-23 13:32:11,262 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-23 13:32:11,262 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-23 13:32:11,262 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 13:32:11,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 91 transitions. [2018-11-23 13:32:11,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:11,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:11,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:11,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:11,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:11,263 INFO L794 eck$LassoCheckResult]: Stem: 2004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2002#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2003#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 2000#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 2001#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 2008#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2011#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2012#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2033#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2034#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2013#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2014#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2031#L69-3 assume !(q1_~i~1 < q1_~N~0); 2032#L69-4 q1_~i~1 := 0; 2029#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2030#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2021#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2022#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2061#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2060#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2059#L70-3 assume !(q1_~i~1 < q1_~N~0); 2058#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2057#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2056#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2053#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2050#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2051#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2062#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2055#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2016#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2017#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2054#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2052#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2024#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1991#L19-3 [2018-11-23 13:32:11,263 INFO L796 eck$LassoCheckResult]: Loop: 1991#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1992#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2005#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1995#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1991#L19-3 [2018-11-23 13:32:11,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2018-11-23 13:32:11,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:11,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:32:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,266 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:11,266 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:11,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:32:11,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:32:11,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:32:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:11,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2018-11-23 13:32:11,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:11,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2018-11-23 13:32:11,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:11,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:11,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:11,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:11,358 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:11,358 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:11,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:11,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:32:11,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:32:11,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:32:11,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:32:11,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 85 [2018-11-23 13:32:11,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,518 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 112 [2018-11-23 13:32:11,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2018-11-23 13:32:11,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,571 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:30 [2018-11-23 13:32:11,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-23 13:32:11,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:32:11,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-23 13:32:11,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:32:11,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:5 [2018-11-23 13:32:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:32:11,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:32:11,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-23 13:32:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:32:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:32:11,790 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. cyclomatic complexity: 22 Second operand 18 states. [2018-11-23 13:32:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:32:12,223 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2018-11-23 13:32:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:32:12,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 215 transitions. [2018-11-23 13:32:12,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 13:32:12,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 172 states and 215 transitions. [2018-11-23 13:32:12,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 13:32:12,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 13:32:12,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 215 transitions. [2018-11-23 13:32:12,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:32:12,226 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 215 transitions. [2018-11-23 13:32:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 215 transitions. [2018-11-23 13:32:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 106. [2018-11-23 13:32:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 13:32:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2018-11-23 13:32:12,232 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 132 transitions. [2018-11-23 13:32:12,232 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 132 transitions. [2018-11-23 13:32:12,232 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 13:32:12,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 132 transitions. [2018-11-23 13:32:12,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:32:12,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:32:12,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:32:12,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:32:12,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:32:12,234 INFO L794 eck$LassoCheckResult]: Stem: 2415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2413#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2414#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 2411#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 2412#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 2418#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2421#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2422#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2444#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2445#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2423#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2424#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2427#L69-3 assume !(q1_~i~1 < q1_~N~0); 2419#L69-4 q1_~i~1 := 0; 2420#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2435#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2436#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2437#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2438#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2446#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2447#L70-3 assume !(q1_~i~1 < q1_~N~0); 2409#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2410#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2432#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2503#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2502#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2407#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2408#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2494#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2458#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2457#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2454#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2455#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2433#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2402#L19-3 [2018-11-23 13:32:12,234 INFO L796 eck$LassoCheckResult]: Loop: 2402#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2403#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2416#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2406#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2402#L19-3 [2018-11-23 13:32:12,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2018-11-23 13:32:12,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:12,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,238 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:12,238 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:12,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:32:12,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:32:12,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:32:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:12,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2018-11-23 13:32:12,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:12,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:32:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2018-11-23 13:32:12,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:32:12,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:32:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:32:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:32:12,373 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:32:12,373 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:32:12,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9880d20-e0bb-4e80-9074-55efab63f128/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:32:12,380 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:32:12,739 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:32:12,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 13:32:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:32:20,378 WARN L180 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 326 DAG size of output: 267 [2018-11-23 13:38:41,826 WARN L180 SmtUtils]: Spent 6.34 m on a formula simplification. DAG size of input: 575 DAG size of output: 188 [2018-11-23 13:38:41,828 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:38:41,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:38:41,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:38:41,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:38:41,829 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:38:41,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:38:41,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:38:41,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:38:41,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-23 13:38:41,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:38:41,829 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:38:41,840 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-23 13:38:41,842 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-23 13:38:41,843 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-23 13:38:41,844 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-23 13:38:41,846 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-23 13:38:41,847 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-23 13:38:41,848 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-23 13:38:41,849 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-23 13:38:41,850 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-23 13:38:41,851 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-23 13:38:41,853 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-23 13:38:41,858 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-23 13:38:41,859 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-23 13:38:41,860 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-23 13:38:41,861 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-23 13:38:41,865 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-23 13:38:41,866 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-23 13:38:42,332 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:38:42,334 INFO L168 Benchmark]: Toolchain (without parser) took 426928.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.6 MB). Free memory was 959.3 MB in the beginning and 1.0 GB in the end (delta: -42.7 MB). Peak memory consumption was 426.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,335 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:38:42,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,336 INFO L168 Benchmark]: Boogie Preprocessor took 59.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,337 INFO L168 Benchmark]: RCFGBuilder took 270.96 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.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,337 INFO L168 Benchmark]: BuchiAutomizer took 426370.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.5 MB). Peak memory consumption was 444.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:38:42,340 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 270.96 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.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 426370.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.5 MB). Peak memory consumption was 444.8 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...