./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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_0a6ca324-a962-40d7-a751-231ac899d157/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-635dfa2 [2018-12-02 03:12:31,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:12:31,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:12:31,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:12:31,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:12:31,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:12:31,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:12:31,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:12:31,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:12:31,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:12:31,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:12:31,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:12:31,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:12:31,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:12:31,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:12:31,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:12:31,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:12:31,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:12:31,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:12:31,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:12:31,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:12:31,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:12:31,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:12:31,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:12:31,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:12:31,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:12:31,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:12:31,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:12:31,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:12:31,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:12:31,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:12:31,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:12:31,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:12:31,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:12:31,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:12:31,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:12:31,474 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 03:12:31,486 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:12:31,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:12:31,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:12:31,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:12:31,487 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:12:31,487 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 03:12:31,487 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 03:12:31,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:12:31,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:12:31,489 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 03:12:31,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 03:12:31,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:12:31,490 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 03:12:31,491 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 03:12:31,491 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_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:31,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:12:31,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:12:31,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:12:31,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:12:31,526 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:12:31,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/../../sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-12-02 03:12:31,569 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/data/894a90ef7/e9bdc46d0ea64369b866c981382bc98a/FLAG7cdd641cf [2018-12-02 03:12:31,957 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:12:31,958 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-12-02 03:12:31,961 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/data/894a90ef7/e9bdc46d0ea64369b866c981382bc98a/FLAG7cdd641cf [2018-12-02 03:12:31,969 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/bin-2019/uautomizer/data/894a90ef7/e9bdc46d0ea64369b866c981382bc98a [2018-12-02 03:12:31,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:12:31,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:12:31,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:12:31,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:12:31,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:12:31,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:31" (1/1) ... [2018-12-02 03:12:31,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f49b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:31, skipping insertion in model container [2018-12-02 03:12:31,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:31" (1/1) ... [2018-12-02 03:12:31,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:12:31,990 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:12:32,088 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:12:32,094 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:12:32,110 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:12:32,119 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:12:32,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32 WrapperNode [2018-12-02 03:12:32,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:12:32,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:12:32,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:12:32,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:12:32,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:12:32,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:12:32,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:12:32,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:12:32,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... [2018-12-02 03:12:32,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:12:32,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:12:32,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:12:32,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:12:32,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:12:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:12:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:12:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:12:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:12:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:12:32,371 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:12:32,371 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-02 03:12:32,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:32 BoogieIcfgContainer [2018-12-02 03:12:32,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:12:32,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 03:12:32,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 03:12:32,375 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 03:12:32,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:12:32,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:12:31" (1/3) ... [2018-12-02 03:12:32,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38fc3ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:12:32, skipping insertion in model container [2018-12-02 03:12:32,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:12:32,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:32" (2/3) ... [2018-12-02 03:12:32,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38fc3ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:12:32, skipping insertion in model container [2018-12-02 03:12:32,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:12:32,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:32" (3/3) ... [2018-12-02 03:12:32,377 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubble_sort_true-unreach-call_true-termination.i [2018-12-02 03:12:32,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:12:32,411 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 03:12:32,411 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 03:12:32,412 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 03:12:32,412 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:12:32,412 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:12:32,412 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 03:12:32,412 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:12:32,412 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 03:12:32,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-12-02 03:12:32,434 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2018-12-02 03:12:32,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:32,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:32,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 03:12:32,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:32,439 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 03:12:32,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-12-02 03:12:32,440 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2018-12-02 03:12:32,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:32,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:32,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 03:12:32,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:32,445 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-12-02 03:12:32,445 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-12-02 03:12:32,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-12-02 03:12:32,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:32,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:32,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:12:32,529 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:32,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2018-12-02 03:12:32,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:32,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:12:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:12:32,590 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-12-02 03:12:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:32,603 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-02 03:12:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:12:32,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-12-02 03:12:32,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-02 03:12:32,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2018-12-02 03:12:32,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 03:12:32,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 03:12:32,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-12-02 03:12:32,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:32,610 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-02 03:12:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-12-02 03:12:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-02 03:12:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 03:12:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-02 03:12:32,627 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 03:12:32,627 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 03:12:32,627 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 03:12:32,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-02 03:12:32,628 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-02 03:12:32,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:32,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:32,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 03:12:32,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:32,628 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-12-02 03:12:32,629 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-12-02 03:12:32,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2018-12-02 03:12:32,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:32,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2018-12-02 03:12:32,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:32,648 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2018-12-02 03:12:32,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:32,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:32,842 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:12:32,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:12:32,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:12:32,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:12:32,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:12:32,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:12:32,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:12:32,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:12:32,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-02 03:12:32,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:12:32,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:12:32,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-12-02 03:12:32,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:32,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:33,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:12:33,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:12:33,060 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-12-02 03:12:33,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:33,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:33,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:33,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:33,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:33,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:33,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:12:33,099 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 03:12:33,099 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 03:12:33,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:12:33,102 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:12:33,103 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:12:33,103 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-12-02 03:12:33,106 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 03:12:33,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:12:33,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,156 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-12-02 03:12:33,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 03:12:33,181 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-12-02 03:12:33,182 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-12-02 03:12:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:12:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-12-02 03:12:33,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-02 03:12:33,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:33,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 03:12:33,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:33,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 03:12:33,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:33,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2018-12-02 03:12:33,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-12-02 03:12:33,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-12-02 03:12:33,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 03:12:33,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 03:12:33,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-12-02 03:12:33,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,188 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-02 03:12:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-12-02 03:12:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-02 03:12:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 03:12:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-12-02 03:12:33,189 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-02 03:12:33,189 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-02 03:12:33,189 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 03:12:33,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-12-02 03:12:33,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-02 03:12:33,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 03:12:33,191 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-12-02 03:12:33,191 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-12-02 03:12:33,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2018-12-02 03:12:33,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:12:33,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:33,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2018-12-02 03:12:33,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:12:33,210 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:12:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:12:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:12:33,210 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 03:12:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:33,220 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-12-02 03:12:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:12:33,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-12-02 03:12:33,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2018-12-02 03:12:33,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 03:12:33,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 03:12:33,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-12-02 03:12:33,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,223 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-02 03:12:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-12-02 03:12:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 03:12:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 03:12:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-12-02 03:12:33,224 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-02 03:12:33,224 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-02 03:12:33,225 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 03:12:33,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-12-02 03:12:33,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,226 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-12-02 03:12:33,226 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-12-02 03:12:33,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2018-12-02 03:12:33,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:12:33,239 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2018-12-02 03:12:33,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:12:33,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:12:33,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:12:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:12:33,249 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 03:12:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:33,257 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-12-02 03:12:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:12:33,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-02 03:12:33,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2018-12-02 03:12:33,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 03:12:33,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 03:12:33,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-02 03:12:33,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,259 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 03:12:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-02 03:12:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-02 03:12:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 03:12:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-02 03:12:33,261 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-02 03:12:33,261 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-02 03:12:33,261 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 03:12:33,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-12-02 03:12:33,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,262 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-12-02 03:12:33,263 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-12-02 03:12:33,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2018-12-02 03:12:33,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:12:33,274 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:33,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2018-12-02 03:12:33,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:12:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:12:33,358 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 03:12:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:33,362 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-12-02 03:12:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:12:33,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-12-02 03:12:33,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2018-12-02 03:12:33,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 03:12:33,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 03:12:33,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-12-02 03:12:33,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,364 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 03:12:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-12-02 03:12:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 03:12:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 03:12:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-02 03:12:33,365 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 03:12:33,365 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 03:12:33,365 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 03:12:33,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-02 03:12:33,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:33,366 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-12-02 03:12:33,366 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-12-02 03:12:33,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2018-12-02 03:12:33,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2018-12-02 03:12:33,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,376 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:33,376 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:33,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2018-12-02 03:12:33,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,411 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:33,411 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:33,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:33,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:12:33,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:12:33,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:12:33,530 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-02 03:12:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:33,576 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-12-02 03:12:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:12:33,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2018-12-02 03:12:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-12-02 03:12:33,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2018-12-02 03:12:33,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-02 03:12:33,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-02 03:12:33,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2018-12-02 03:12:33,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,578 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-12-02 03:12:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2018-12-02 03:12:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-12-02 03:12:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 03:12:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-02 03:12:33,580 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 03:12:33,580 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 03:12:33,580 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 03:12:33,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-02 03:12:33,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,581 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-12-02 03:12:33,581 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-12-02 03:12:33,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2018-12-02 03:12:33,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2018-12-02 03:12:33,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2018-12-02 03:12:33,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:12:33,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:12:33,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:12:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:12:33,734 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-02 03:12:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:33,776 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-12-02 03:12:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:12:33,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-12-02 03:12:33,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 27 transitions. [2018-12-02 03:12:33,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 03:12:33,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 03:12:33,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-12-02 03:12:33,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:33,778 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 03:12:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-12-02 03:12:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 03:12:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 03:12:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 03:12:33,779 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 03:12:33,779 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 03:12:33,779 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 03:12:33,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-02 03:12:33,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:33,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:33,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:33,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:33,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:33,780 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-12-02 03:12:33,781 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-12-02 03:12:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2018-12-02 03:12:33,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,785 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:33,785 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:33,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:33,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,831 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2018-12-02 03:12:33,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,833 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:33,833 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:33,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:33,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 03:12:33,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:33,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2018-12-02 03:12:33,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:33,878 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:33,878 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:33,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:33,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:33,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:33,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:33,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-02 03:12:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:12:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:12:34,020 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-12-02 03:12:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:34,059 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-12-02 03:12:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:12:34,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2018-12-02 03:12:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-12-02 03:12:34,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2018-12-02 03:12:34,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-02 03:12:34,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-02 03:12:34,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-12-02 03:12:34,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:12:34,061 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-02 03:12:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-12-02 03:12:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2018-12-02 03:12:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 03:12:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-12-02 03:12:34,063 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 03:12:34,063 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-02 03:12:34,063 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 03:12:34,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-12-02 03:12:34,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-02 03:12:34,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:34,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:34,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:34,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:12:34,064 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-12-02 03:12:34,064 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-12-02 03:12:34,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2018-12-02 03:12:34,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,069 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:34,069 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:34,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:34,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:34,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:34,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2018-12-02 03:12:34,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,129 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:34,129 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:34,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:12:34,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 03:12:34,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:34,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2018-12-02 03:12:34,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:34,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:34,158 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:34,158 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:34,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:34,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:34,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:34,704 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2018-12-02 03:12:35,121 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-12-02 03:12:35,123 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:12:35,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:12:35,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:12:35,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:12:35,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:12:35,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:12:35,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:12:35,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:12:35,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-02 03:12:35,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:12:35,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:12:35,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,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-12-02 03:12:35,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,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-12-02 03:12:35,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,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-12-02 03:12:35,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,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-12-02 03:12:35,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:35,915 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-12-02 03:12:37,731 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-02 03:12:37,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:12:37,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:12:37,768 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-12-02 03:12:37,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:37,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:37,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:37,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:37,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:37,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:37,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:37,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:37,770 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-12-02 03:12:37,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:37,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:37,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:37,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:37,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:37,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:37,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:37,773 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-12-02 03:12:37,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:37,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:37,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:37,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:37,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:37,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:37,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:37,776 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-12-02 03:12:37,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:37,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:37,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:37,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:37,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:37,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:37,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:37,780 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-12-02 03:12:37,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:37,780 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:12:37,780 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 03:12:37,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:37,788 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2018-12-02 03:12:37,788 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-02 03:12:37,891 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:12:37,968 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 03:12:37,968 INFO L444 ModelExtractionUtils]: 40 out of 50 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 03:12:37,968 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:12:37,970 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-12-02 03:12:37,970 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:12:37,970 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-12-02 03:12:37,978 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-02 03:12:38,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:38,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:38,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:38,027 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-12-02 03:12:38,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 03:12:38,041 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-12-02 03:12:38,042 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-12-02 03:12:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:12:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-02 03:12:38,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-02 03:12:38,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:38,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-02 03:12:38,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:38,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2018-12-02 03:12:38,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:38,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2018-12-02 03:12:38,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 03:12:38,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2018-12-02 03:12:38,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 03:12:38,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 03:12:38,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2018-12-02 03:12:38,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:38,044 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-02 03:12:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2018-12-02 03:12:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-02 03:12:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 03:12:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-12-02 03:12:38,046 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-02 03:12:38,046 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-12-02 03:12:38,046 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 03:12:38,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-12-02 03:12:38,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 03:12:38,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:38,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:38,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:38,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:38,047 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-12-02 03:12:38,047 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-12-02 03:12:38,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2018-12-02 03:12:38,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:38,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,051 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:38,051 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:38,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:38,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2018-12-02 03:12:38,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2018-12-02 03:12:38,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,116 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:38,116 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:38,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:38,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 03:12:38,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:38,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-12-02 03:12:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:12:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:12:38,242 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 03:12:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:38,282 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-02 03:12:38,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:12:38,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-12-02 03:12:38,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 03:12:38,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2018-12-02 03:12:38,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 03:12:38,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 03:12:38,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-12-02 03:12:38,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:38,284 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 03:12:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-12-02 03:12:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-02 03:12:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 03:12:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-02 03:12:38,285 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 03:12:38,286 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 03:12:38,286 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 03:12:38,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-12-02 03:12:38,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 03:12:38,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:38,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:38,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:38,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:38,287 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-12-02 03:12:38,287 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-12-02 03:12:38,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2018-12-02 03:12:38,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,291 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:38,291 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:38,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:38,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:38,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:38,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2018-12-02 03:12:38,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:38,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2018-12-02 03:12:38,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:38,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:38,382 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:38,382 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:38,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:38,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:38,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:38,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:39,684 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 204 DAG size of output: 178 [2018-12-02 03:12:41,864 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 121 [2018-12-02 03:12:41,865 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:12:41,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:12:41,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:12:41,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:12:41,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:12:41,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:12:41,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:12:41,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:12:41,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration11_Lasso [2018-12-02 03:12:41,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:12:41,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:12:41,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:41,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,158 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-12-02 03:12:42,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:42,624 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-12-02 03:12:42,676 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:12:42,676 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:12:42,677 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-12-02 03:12:42,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,678 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-12-02 03:12:42,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,679 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-12-02 03:12:42,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:42,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,681 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-12-02 03:12:42,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,682 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-12-02 03:12:42,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,684 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-12-02 03:12:42,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,685 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-12-02 03:12:42,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:42,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,687 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-12-02 03:12:42,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,688 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-12-02 03:12:42,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,689 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-12-02 03:12:42,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,690 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-12-02 03:12:42,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,691 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-12-02 03:12:42,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:42,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,693 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-12-02 03:12:42,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,694 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-12-02 03:12:42,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:42,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:42,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:42,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,695 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-12-02 03:12:42,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:42,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,698 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-12-02 03:12:42,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:42,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:42,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:42,700 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-12-02 03:12:42,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:42,701 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:12:42,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:42,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:42,702 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:12:42,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:42,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:12:42,733 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 03:12:42,733 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 03:12:42,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:12:42,734 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:12:42,734 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:12:42,734 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-12-02 03:12:42,768 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-12-02 03:12:42,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:42,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:42,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 03:12:42,798 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-12-02 03:12:42,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-02 03:12:42,807 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-12-02 03:12:42,807 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-12-02 03:12:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:12:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-02 03:12:42,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2018-12-02 03:12:42,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:42,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2018-12-02 03:12:42,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:42,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2018-12-02 03:12:42,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:42,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-12-02 03:12:42,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:42,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2018-12-02 03:12:42,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 03:12:42,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 03:12:42,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2018-12-02 03:12:42,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:42,809 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-02 03:12:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2018-12-02 03:12:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-02 03:12:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 03:12:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 03:12:42,810 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 03:12:42,810 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 03:12:42,810 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 03:12:42,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-12-02 03:12:42,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:42,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:42,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:42,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:12:42,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:42,811 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-12-02 03:12:42,811 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-12-02 03:12:42,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2018-12-02 03:12:42,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:42,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,814 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:42,814 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:42,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:42,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:42,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2018-12-02 03:12:42,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:42,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2018-12-02 03:12:42,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:42,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:42,872 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:42,872 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:42,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:44,093 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 208 DAG size of output: 181 [2018-12-02 03:12:47,246 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 219 DAG size of output: 124 [2018-12-02 03:12:47,248 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:12:47,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:12:47,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:12:47,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:12:47,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:12:47,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:12:47,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:12:47,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:12:47,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-02 03:12:47,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:12:47,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:12:47,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:47,608 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-12-02 03:12:47,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:12:48,075 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-12-02 03:12:48,109 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:12:48,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:12:48,109 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-12-02 03:12:48,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,111 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-12-02 03:12:48,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,112 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-12-02 03:12:48,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,116 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-12-02 03:12:48,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,118 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-12-02 03:12:48,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,119 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-12-02 03:12:48,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,122 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-12-02 03:12:48,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,123 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-12-02 03:12:48,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,125 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-12-02 03:12:48,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:12:48,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,128 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-12-02 03:12:48,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,130 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-12-02 03:12:48,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,132 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-12-02 03:12:48,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,135 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-12-02 03:12:48,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,138 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-12-02 03:12:48,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,139 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-12-02 03:12:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,140 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-12-02 03:12:48,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,142 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-12-02 03:12:48,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,143 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-12-02 03:12:48,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,145 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-12-02 03:12:48,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:12:48,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,149 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-12-02 03:12:48,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:12:48,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:12:48,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:12:48,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,150 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-12-02 03:12:48,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,151 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-12-02 03:12:48,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:12:48,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:12:48,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:12:48,154 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-12-02 03:12:48,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:12:48,154 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:12:48,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:12:48,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:12:48,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:12:48,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:12:48,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:12:48,182 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 03:12:48,183 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 03:12:48,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:12:48,183 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:12:48,183 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:12:48,183 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-12-02 03:12:48,228 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-12-02 03:12:48,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:48,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:48,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:12:48,270 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-12-02 03:12:48,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 03:12:48,287 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-12-02 03:12:48,287 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-12-02 03:12:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:12:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-02 03:12:48,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 03:12:48,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:48,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-02 03:12:48,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:48,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2018-12-02 03:12:48,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:12:48,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2018-12-02 03:12:48,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2018-12-02 03:12:48,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 03:12:48,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 03:12:48,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2018-12-02 03:12:48,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:48,289 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-12-02 03:12:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2018-12-02 03:12:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-12-02 03:12:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 03:12:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-12-02 03:12:48,290 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-02 03:12:48,290 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-12-02 03:12:48,290 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 03:12:48,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2018-12-02 03:12:48,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:48,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:48,291 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-12-02 03:12:48,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:48,291 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-12-02 03:12:48,291 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-12-02 03:12:48,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2018-12-02 03:12:48,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:48,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,294 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:48,294 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:48,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:48,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 03:12:48,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:48,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-12-02 03:12:48,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:48,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2018-12-02 03:12:48,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:12:48,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:12:48,414 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-02 03:12:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:48,473 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-12-02 03:12:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:12:48,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-12-02 03:12:48,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2018-12-02 03:12:48,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 03:12:48,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 03:12:48,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-12-02 03:12:48,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:48,474 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-12-02 03:12:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-12-02 03:12:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-12-02 03:12:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 03:12:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-02 03:12:48,475 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-02 03:12:48,475 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-02 03:12:48,475 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 03:12:48,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2018-12-02 03:12:48,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:48,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:48,476 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-12-02 03:12:48,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:48,476 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-12-02 03:12:48,476 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-12-02 03:12:48,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2018-12-02 03:12:48,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:48,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,479 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:48,479 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:48,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:48,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:48,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:48,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:12:48,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 03:12:48,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:48,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-12-02 03:12:48,535 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:12:48,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2018-12-02 03:12:48,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:12:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:12:48,583 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-02 03:12:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:48,664 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-12-02 03:12:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:12:48,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2018-12-02 03:12:48,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2018-12-02 03:12:48,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 03:12:48,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 03:12:48,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-12-02 03:12:48,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:48,665 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-02 03:12:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-12-02 03:12:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2018-12-02 03:12:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 03:12:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-02 03:12:48,666 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 03:12:48,666 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 03:12:48,666 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 03:12:48,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2018-12-02 03:12:48,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:48,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:48,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:48,667 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-12-02 03:12:48,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:48,667 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-12-02 03:12:48,667 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-12-02 03:12:48,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,667 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2018-12-02 03:12:48,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:48,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,670 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:48,670 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:48,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:48,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:12:48,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 03:12:48,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2018-12-02 03:12:48,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:48,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2018-12-02 03:12:48,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:48,767 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:48,767 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:48,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:12:48,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:48,904 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-12-02 03:12:48,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:48,908 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-12-02 03:12:48,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:12:48,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:48,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:48,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2018-12-02 03:12:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 03:12:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:48,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-12-02 03:12:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 03:12:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-02 03:12:48,983 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand 18 states. [2018-12-02 03:12:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:49,311 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2018-12-02 03:12:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 03:12:49,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 146 transitions. [2018-12-02 03:12:49,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-02 03:12:49,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 146 transitions. [2018-12-02 03:12:49,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-12-02 03:12:49,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-12-02 03:12:49,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2018-12-02 03:12:49,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:49,312 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 146 transitions. [2018-12-02 03:12:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2018-12-02 03:12:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2018-12-02 03:12:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 03:12:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-12-02 03:12:49,315 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-12-02 03:12:49,315 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-12-02 03:12:49,315 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 03:12:49,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 91 transitions. [2018-12-02 03:12:49,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:49,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:49,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:49,316 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-12-02 03:12:49,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:49,316 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-12-02 03:12:49,316 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-12-02 03:12:49,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:49,316 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2018-12-02 03:12:49,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:49,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:12:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,319 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:49,319 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:49,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:49,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:12:49,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:12:49,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:49,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2018-12-02 03:12:49,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:49,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:49,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:49,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:49,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2018-12-02 03:12:49,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:49,405 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:49,405 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:49,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:49,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:12:49,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 03:12:49,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:12:49,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:12:49,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,521 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-12-02 03:12:49,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,541 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-12-02 03:12:49,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,579 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-12-02 03:12:49,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:30 [2018-12-02 03:12:49,692 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-12-02 03:12:49,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:12:49,695 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-12-02 03:12:49,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:12:49,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:5 [2018-12-02 03:12:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 03:12:49,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:12:49,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-12-02 03:12:49,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 03:12:49,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-02 03:12:49,789 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. cyclomatic complexity: 22 Second operand 18 states. [2018-12-02 03:12:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:12:50,212 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2018-12-02 03:12:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 03:12:50,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 215 transitions. [2018-12-02 03:12:50,213 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-02 03:12:50,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 172 states and 215 transitions. [2018-12-02 03:12:50,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-02 03:12:50,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-02 03:12:50,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 215 transitions. [2018-12-02 03:12:50,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:12:50,216 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 215 transitions. [2018-12-02 03:12:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 215 transitions. [2018-12-02 03:12:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 106. [2018-12-02 03:12:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 03:12:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2018-12-02 03:12:50,220 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 132 transitions. [2018-12-02 03:12:50,221 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 132 transitions. [2018-12-02 03:12:50,221 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 03:12:50,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 132 transitions. [2018-12-02 03:12:50,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:12:50,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:12:50,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:12:50,222 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-12-02 03:12:50,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 03:12:50,222 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-12-02 03:12:50,222 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-12-02 03:12:50,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2018-12-02 03:12:50,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:50,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,226 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:50,227 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:50,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:50,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 03:12:50,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 03:12:50,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:50,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2018-12-02 03:12:50,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:50,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:50,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:50,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:12:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2018-12-02 03:12:50,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:12:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:12:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:12:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:12:50,312 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 03:12:50,312 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 03:12:50,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6ca324-a962-40d7-a751-231ac899d157/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-12-02 03:12:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 03:12:50,675 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-02 03:12:50,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 03:12:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:12:58,116 WARN L180 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 326 DAG size of output: 267 [2018-12-02 03:21:20,035 WARN L180 SmtUtils]: Spent 8.35 m on a formula simplification. DAG size of input: 575 DAG size of output: 188 [2018-12-02 03:21:20,038 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:21:20,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:21:20,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:21:20,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:21:20,038 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:21:20,038 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:21:20,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:21:20,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:21:20,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-12-02 03:21:20,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:21:20,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:21:20,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:21:20,510 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-12-02 03:21:20,512 INFO L168 Benchmark]: Toolchain (without parser) took 528541.12 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.6 MB). Free memory was 961.4 MB in the beginning and 1.3 GB in the end (delta: -317.3 MB). Peak memory consumption was 663.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:21:20,513 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:21:20,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:21:20,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:21:20,514 INFO L168 Benchmark]: Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:21:20,514 INFO L168 Benchmark]: RCFGBuilder took 182.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:21:20,515 INFO L168 Benchmark]: BuchiAutomizer took 528139.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.9 MB). Peak memory consumption was 675.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:21:20,517 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 182.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 528139.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.9 MB). Peak memory consumption was 675.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...