./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/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_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/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 Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:35:52,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:35:52,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:35:52,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:35:52,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:35:52,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:35:52,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:35:52,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:35:52,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:35:52,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:35:52,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:35:52,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:35:52,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:35:52,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:35:52,904 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:35:52,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:35:52,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:35:52,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:35:52,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:35:52,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:35:52,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:35:52,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:35:52,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:35:52,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:35:52,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:35:52,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:35:52,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:35:52,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:35:52,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:35:52,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:35:52,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:35:52,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:35:52,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:35:52,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:35:52,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:35:52,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:35:52,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 02:35:52,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:35:52,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:35:52,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:35:52,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:35:52,932 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:35:52,933 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:35:52,933 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:35:52,933 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:35:52,933 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:35:52,933 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:35:52,933 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:35:52,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:35:52,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:35:52,935 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:35:52,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:35:52,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:35:52,936 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:35:52,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:35:52,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:35:52,936 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:35:52,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:35:52,937 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_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b59596f519f075436dc724f37897dcc3b0f74afa [2018-11-10 02:35:52,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:35:52,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:35:52,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:35:52,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:35:52,974 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:35:52,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-11-10 02:35:53,015 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/data/07b2eef71/a3722316962745e48762376d5163adc3/FLAGfcc40e0f7 [2018-11-10 02:35:53,363 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:35:53,364 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/sv-benchmarks/c/loops/bubble_sort_true-unreach-call_true-termination.i [2018-11-10 02:35:53,368 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/data/07b2eef71/a3722316962745e48762376d5163adc3/FLAGfcc40e0f7 [2018-11-10 02:35:53,377 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/data/07b2eef71/a3722316962745e48762376d5163adc3 [2018-11-10 02:35:53,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:35:53,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:35:53,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:35:53,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:35:53,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:35:53,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496ea709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53, skipping insertion in model container [2018-11-10 02:35:53,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:35:53,414 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:35:53,533 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:35:53,539 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:35:53,557 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:35:53,567 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:35:53,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53 WrapperNode [2018-11-10 02:35:53,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:35:53,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:35:53,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:35:53,568 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:35:53,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:35:53,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:35:53,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:35:53,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:35:53,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... [2018-11-10 02:35:53,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:35:53,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:35:53,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:35:53,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:35:53,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:53,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:35:53,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:35:53,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:35:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:35:54,003 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:35:54,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:54 BoogieIcfgContainer [2018-11-10 02:35:54,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:35:54,004 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:35:54,004 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:35:54,007 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:35:54,008 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:54,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:35:53" (1/3) ... [2018-11-10 02:35:54,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5390f3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:35:54, skipping insertion in model container [2018-11-10 02:35:54,009 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:54,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:53" (2/3) ... [2018-11-10 02:35:54,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5390f3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:35:54, skipping insertion in model container [2018-11-10 02:35:54,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:54,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:54" (3/3) ... [2018-11-10 02:35:54,012 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubble_sort_true-unreach-call_true-termination.i [2018-11-10 02:35:54,066 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:35:54,066 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:35:54,067 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:35:54,067 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:35:54,067 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:35:54,067 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:35:54,067 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:35:54,067 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:35:54,067 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:35:54,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 02:35:54,101 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2018-11-10 02:35:54,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:54,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:54,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:35:54,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:35:54,106 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:35:54,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 02:35:54,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2018-11-10 02:35:54,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:54,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:54,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:35:54,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:35:54,114 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 32#L55true assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 6#L62true assume q1_#t~switch13;q1_~i~1 := 0; 19#L63-5true [2018-11-10 02:35:54,114 INFO L795 eck$LassoCheckResult]: Loop: 19#L63-5true assume true; 26#L63-1true assume !!(q1_~i~1 < q1_~N~0); 24#L63-3true SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L63-3 23#L63-4true q1_#t~pre14 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre14; 19#L63-5true [2018-11-10 02:35:54,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2018-11-10 02:35:54,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:54,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:54,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:54,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:54,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:35:54,233 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:35:54,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1359496, now seen corresponding path program 1 times [2018-11-10 02:35:54,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:54,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:35:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:35:54,316 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-10 02:35:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:35:54,338 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-10 02:35:54,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:35:54,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-10 02:35:54,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-10 02:35:54,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 44 transitions. [2018-11-10 02:35:54,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 02:35:54,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 02:35:54,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-11-10 02:35:54,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:35:54,349 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-10 02:35:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-11-10 02:35:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-10 02:35:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 02:35:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-10 02:35:54,377 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 02:35:54,377 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 02:35:54,378 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:35:54,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2018-11-10 02:35:54,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-10 02:35:54,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:54,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:54,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:35:54,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:35:54,380 INFO L793 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 116#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 110#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 111#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 120#L68 assume q1_#t~switch13;q1_~i~1 := 0; 118#L69-5 [2018-11-10 02:35:54,380 INFO L795 eck$LassoCheckResult]: Loop: 118#L69-5 assume true; 119#L69-1 assume !!(q1_~i~1 < q1_~N~0); 122#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 121#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 118#L69-5 [2018-11-10 02:35:54,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash 889586714, now seen corresponding path program 1 times [2018-11-10 02:35:54,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2590856, now seen corresponding path program 1 times [2018-11-10 02:35:54,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2079053857, now seen corresponding path program 1 times [2018-11-10 02:35:54,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:54,635 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-10 02:35:54,717 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:35:54,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:35:54,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:35:54,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:35:54,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:35:54,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:54,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:35:54,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:35:54,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-10 02:35:54,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:35:54,721 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:35:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,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-11-10 02:35:54,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:54,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-11-10 02:35:55,150 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:35:55,153 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:35:55,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:55,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:55,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:55,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:55,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:55,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:55,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:55,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:55,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:55,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:55,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:55,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:55,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:55,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:55,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:55,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:55,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:55,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:55,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:55,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:35:55,286 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:35:55,286 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:35:55,289 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:35:55,290 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:35:55,291 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:35:55,291 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1, ULTIMATE.start_q1_~i~1, ULTIMATE.start_q1_~#a~1.offset) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1 - 4*ULTIMATE.start_q1_~i~1 - 1*ULTIMATE.start_q1_~#a~1.offset Supporting invariants [] [2018-11-10 02:35:55,299 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 02:35:55,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:35:55,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:35:55,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 02:35:55,388 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 59 states and 69 transitions. Complement of second has 7 states. [2018-11-10 02:35:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:35:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-10 02:35:55,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 02:35:55,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:55,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 02:35:55,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:55,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-10 02:35:55,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:55,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-11-10 02:35:55,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2018-11-10 02:35:55,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 66 transitions. [2018-11-10 02:35:55,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 02:35:55,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-10 02:35:55,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 66 transitions. [2018-11-10 02:35:55,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:55,395 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-10 02:35:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 66 transitions. [2018-11-10 02:35:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-10 02:35:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 02:35:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-10 02:35:55,399 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 02:35:55,399 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-10 02:35:55,399 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:35:55,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-10 02:35:55,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 02:35:55,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:55,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:55,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:55,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:35:55,401 INFO L793 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 276#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 272#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 273#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 284#L68 assume !q1_#t~switch13; 267#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 268#L17-4 [2018-11-10 02:35:55,401 INFO L795 eck$LassoCheckResult]: Loop: 268#L17-4 assume true; 294#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 288#L19-4 assume true; 289#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 297#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 268#L17-4 [2018-11-10 02:35:55,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1807385626, now seen corresponding path program 1 times [2018-11-10 02:35:55,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:35:55,416 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:35:55,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash 118491836, now seen corresponding path program 1 times [2018-11-10 02:35:55,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:35:55,428 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:35:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:35:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:35:55,429 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 02:35:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:35:55,443 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-10 02:35:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:35:55,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-11-10 02:35:55,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:35:55,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 48 transitions. [2018-11-10 02:35:55,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 02:35:55,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 02:35:55,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2018-11-10 02:35:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:55,446 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-10 02:35:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2018-11-10 02:35:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 02:35:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 02:35:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-10 02:35:55,448 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-10 02:35:55,448 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-10 02:35:55,448 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:35:55,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2018-11-10 02:35:55,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:35:55,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:55,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:55,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:55,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:55,450 INFO L793 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 365#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 359#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 360#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 372#L68 assume !q1_#t~switch13; 354#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 355#L17-4 [2018-11-10 02:35:55,450 INFO L795 eck$LassoCheckResult]: Loop: 355#L17-4 assume true; 381#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 375#L19-4 assume true; 376#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 385#L22 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 382#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 383#L19-4 assume true; 391#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 390#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 355#L17-4 [2018-11-10 02:35:55,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1807385626, now seen corresponding path program 2 times [2018-11-10 02:35:55,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:35:55,476 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:35:55,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1717197611, now seen corresponding path program 1 times [2018-11-10 02:35:55,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:35:55,489 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:35:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:35:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:35:55,490 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 02:35:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:35:55,500 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-10 02:35:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:35:55,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2018-11-10 02:35:55,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:35:55,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 02:35:55,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 02:35:55,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 02:35:55,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-10 02:35:55,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:55,503 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 02:35:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-10 02:35:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 02:35:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 02:35:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 02:35:55,505 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 02:35:55,505 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 02:35:55,505 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:35:55,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-10 02:35:55,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:35:55,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:55,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:55,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:55,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:55,507 INFO L793 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 451#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 452#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 448#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 449#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 460#L68 assume q1_#t~switch13;q1_~i~1 := 0; 456#L69-5 assume true; 457#L69-1 assume !(q1_~i~1 < q1_~N~0); 453#L69-6 q1_~i~1 := 0; 454#L70-3 [2018-11-10 02:35:55,507 INFO L795 eck$LassoCheckResult]: Loop: 454#L70-3 assume true; 468#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 469#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 473#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 450#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 447#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 445#L73-2 havoc q1_#t~mem20; 446#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 455#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 454#L70-3 [2018-11-10 02:35:55,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634181, now seen corresponding path program 1 times [2018-11-10 02:35:55,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:55,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 707197162, now seen corresponding path program 1 times [2018-11-10 02:35:55,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,523 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:35:55,523 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:35:55,524 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:35:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:55,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash 413142502, now seen corresponding path program 1 times [2018-11-10 02:35:55,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:55,585 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:35:55,585 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:35:55,585 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-11-10 02:35:55,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:35:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:55,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:35:57,934 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 02:36:06,561 WARN L179 SmtUtils]: Spent 8.62 s on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-11-10 02:36:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:36:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:36:06,562 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-10 02:36:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:06,609 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-11-10 02:36:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:36:06,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 108 transitions. [2018-11-10 02:36:06,611 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2018-11-10 02:36:06,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 108 transitions. [2018-11-10 02:36:06,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-10 02:36:06,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-10 02:36:06,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 108 transitions. [2018-11-10 02:36:06,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:06,612 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-11-10 02:36:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 108 transitions. [2018-11-10 02:36:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 45. [2018-11-10 02:36:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 02:36:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-10 02:36:06,615 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 02:36:06,615 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 02:36:06,615 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:36:06,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2018-11-10 02:36:06,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:06,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:06,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:06,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:06,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:06,616 INFO L793 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 653#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 649#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 650#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 662#L68 assume q1_#t~switch13;q1_~i~1 := 0; 657#L69-5 assume true; 658#L69-1 assume !(q1_~i~1 < q1_~N~0); 654#L69-6 q1_~i~1 := 0; 655#L70-3 assume true; 671#L70-1 assume !(q1_~i~1 < q1_~N~0); 644#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 645#L17-4 [2018-11-10 02:36:06,616 INFO L795 eck$LassoCheckResult]: Loop: 645#L17-4 assume true; 672#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 667#L19-4 assume true; 668#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 676#L22 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 673#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 674#L19-4 assume true; 685#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 683#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 645#L17-4 [2018-11-10 02:36:06,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 809305682, now seen corresponding path program 1 times [2018-11-10 02:36:06,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:06,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1717197611, now seen corresponding path program 2 times [2018-11-10 02:36:06,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:06,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:36:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:36:06,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:36:06,649 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:36:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:36:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:36:06,650 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 02:36:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:06,689 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-10 02:36:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:36:06,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 52 transitions. [2018-11-10 02:36:06,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:06,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 52 transitions. [2018-11-10 02:36:06,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 02:36:06,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 02:36:06,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 52 transitions. [2018-11-10 02:36:06,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:06,692 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-10 02:36:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 52 transitions. [2018-11-10 02:36:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-10 02:36:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 02:36:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-10 02:36:06,697 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-10 02:36:06,697 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-10 02:36:06,697 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:36:06,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 50 transitions. [2018-11-10 02:36:06,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:06,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:06,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:06,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:06,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:06,699 INFO L793 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 752#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 753#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 747#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 748#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 761#L68 assume q1_#t~switch13;q1_~i~1 := 0; 755#L69-5 assume true; 756#L69-1 assume !(q1_~i~1 < q1_~N~0); 750#L69-6 q1_~i~1 := 0; 751#L70-3 assume true; 768#L70-1 assume !(q1_~i~1 < q1_~N~0); 742#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 743#L17-4 [2018-11-10 02:36:06,699 INFO L795 eck$LassoCheckResult]: Loop: 743#L17-4 assume true; 769#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 764#L19-4 assume true; 765#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 773#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 777#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 779#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 778#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 770#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 771#L19-4 assume true; 781#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 780#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 743#L17-4 [2018-11-10 02:36:06,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 809305682, now seen corresponding path program 2 times [2018-11-10 02:36:06,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 601476504, now seen corresponding path program 1 times [2018-11-10 02:36:06,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:06,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1781719657, now seen corresponding path program 1 times [2018-11-10 02:36:06,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:06,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:36:06,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:36:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:36:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:36:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:36:06,957 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 02:36:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:07,086 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-10 02:36:07,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:36:07,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 69 transitions. [2018-11-10 02:36:07,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:07,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 53 states and 57 transitions. [2018-11-10 02:36:07,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 02:36:07,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 02:36:07,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2018-11-10 02:36:07,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:07,088 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-10 02:36:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2018-11-10 02:36:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-11-10 02:36:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 02:36:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-10 02:36:07,090 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 02:36:07,090 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 02:36:07,090 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:36:07,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2018-11-10 02:36:07,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:07,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:07,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:07,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:07,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:07,091 INFO L793 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 878#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 874#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 875#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 886#L68 assume q1_#t~switch13;q1_~i~1 := 0; 882#L69-5 assume true; 883#L69-1 assume !!(q1_~i~1 < q1_~N~0); 888#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 887#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 884#L69-5 assume true; 885#L69-1 assume !(q1_~i~1 < q1_~N~0); 879#L69-6 q1_~i~1 := 0; 880#L70-3 assume true; 894#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 895#L72 [2018-11-10 02:36:07,091 INFO L795 eck$LassoCheckResult]: Loop: 895#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 899#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 876#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 873#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 871#L73-2 havoc q1_#t~mem20; 872#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 881#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 901#L70-3 assume true; 906#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 895#L72 [2018-11-10 02:36:07,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash 287241059, now seen corresponding path program 1 times [2018-11-10 02:36:07,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:07,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,097 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:07,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:07,098 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:07,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash -522766828, now seen corresponding path program 2 times [2018-11-10 02:36:07,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:07,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:07,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,171 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:07,171 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:07,171 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:07,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:36:07,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 02:36:07,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:07,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:07,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1811345650, now seen corresponding path program 1 times [2018-11-10 02:36:07,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:07,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:07,229 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:07,229 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:07,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:07,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:07,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:36:07,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:36:07,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-10 02:36:07,752 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-10 02:36:12,635 WARN L179 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-11-10 02:36:12,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:36:12,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:36:12,636 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 02:36:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:12,695 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-11-10 02:36:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:36:12,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 127 transitions. [2018-11-10 02:36:12,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2018-11-10 02:36:12,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 127 transitions. [2018-11-10 02:36:12,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-11-10 02:36:12,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 02:36:12,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 127 transitions. [2018-11-10 02:36:12,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:12,697 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-11-10 02:36:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 127 transitions. [2018-11-10 02:36:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 60. [2018-11-10 02:36:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 02:36:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-10 02:36:12,700 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-10 02:36:12,700 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-10 02:36:12,701 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 02:36:12,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 65 transitions. [2018-11-10 02:36:12,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-10 02:36:12,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:12,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:12,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:12,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:12,702 INFO L793 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 1125#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 1121#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 1122#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 1134#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1129#L69-5 assume true; 1130#L69-1 assume !!(q1_~i~1 < q1_~N~0); 1172#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 1135#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 1136#L69-5 assume true; 1132#L69-1 assume !!(q1_~i~1 < q1_~N~0); 1137#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 1138#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 1131#L69-5 assume true; 1133#L69-1 assume !(q1_~i~1 < q1_~N~0); 1126#L69-6 q1_~i~1 := 0; 1127#L70-3 assume true; 1146#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 1147#L72 [2018-11-10 02:36:12,702 INFO L795 eck$LassoCheckResult]: Loop: 1147#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 1151#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 1123#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 1120#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 1118#L73-2 havoc q1_#t~mem20; 1119#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 1128#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 1153#L70-3 assume true; 1158#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 1147#L72 [2018-11-10 02:36:12,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 998881084, now seen corresponding path program 2 times [2018-11-10 02:36:12,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,707 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:12,707 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:12,707 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:12,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:36:12,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:36:12,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:12,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash -522766828, now seen corresponding path program 3 times [2018-11-10 02:36:12,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:12,780 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:12,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:12,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:36:12,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 02:36:12,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:12,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1547202873, now seen corresponding path program 2 times [2018-11-10 02:36:12,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:12,838 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:12,838 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:12,839 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:36:12,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:36:12,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:21,967 WARN L179 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-11-10 02:36:22,267 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 123 [2018-11-10 02:36:22,898 WARN L179 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2018-11-10 02:36:22,901 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:36:22,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:36:22,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:36:22,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:36:22,901 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:36:22,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:36:22,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:36:22,901 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:36:22,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-10 02:36:22,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:36:22,901 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:36:22,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:22,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:23,213 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-10 02:36:25,170 WARN L179 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 02:36:25,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:26,906 WARN L179 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-11-10 02:36:27,185 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-10 02:36:29,447 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-10 02:36:29,459 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:36:29,459 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:36:29,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:29,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:29,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:29,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,527 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:36:29,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,528 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:36:29,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:29,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:29,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:29,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:29,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:29,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:29,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:29,537 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2018-11-10 02:36:29,537 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:36:29,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:29,552 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2018-11-10 02:36:29,552 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 02:36:29,984 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:36:30,140 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 02:36:30,140 INFO L444 ModelExtractionUtils]: 50 out of 64 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-11-10 02:36:30,141 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:36:30,143 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-10 02:36:30,143 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:36:30,143 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~i~1, ULTIMATE.start_q1_~#a~1.offset, v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_2) = -4*ULTIMATE.start_q1_~i~1 - 1*ULTIMATE.start_q1_~#a~1.offset + 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_2 Supporting invariants [] [2018-11-10 02:36:30,163 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 02:36:30,164 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:36:30,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:30,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:30,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:36:30,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:36:30,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 65 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 02:36:30,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 65 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 96 states and 106 transitions. Complement of second has 6 states. [2018-11-10 02:36:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:36:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:36:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-10 02:36:30,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 19 letters. Loop has 9 letters. [2018-11-10 02:36:30,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:30,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 28 letters. Loop has 9 letters. [2018-11-10 02:36:30,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:30,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 19 letters. Loop has 18 letters. [2018-11-10 02:36:30,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:30,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 106 transitions. [2018-11-10 02:36:30,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 02:36:30,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 62 states and 67 transitions. [2018-11-10 02:36:30,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 02:36:30,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 02:36:30,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2018-11-10 02:36:30,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:30,270 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-10 02:36:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2018-11-10 02:36:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-10 02:36:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 02:36:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-10 02:36:30,273 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-10 02:36:30,273 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-10 02:36:30,273 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 02:36:30,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 66 transitions. [2018-11-10 02:36:30,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 02:36:30,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:30,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:30,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:30,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:30,279 INFO L793 eck$LassoCheckResult]: Stem: 1435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 1405#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 1400#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 1401#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 1415#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1410#L69-5 assume true; 1411#L69-1 assume !!(q1_~i~1 < q1_~N~0); 1417#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 1416#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 1412#L69-5 assume true; 1413#L69-1 assume !(q1_~i~1 < q1_~N~0); 1406#L69-6 q1_~i~1 := 0; 1407#L70-3 assume true; 1449#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 1432#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 1429#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 1402#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 1398#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 1394#L73-2 havoc q1_#t~mem20; 1395#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 1408#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 1433#L70-3 assume true; 1423#L70-1 assume !(q1_~i~1 < q1_~N~0); 1392#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 1393#L17-4 [2018-11-10 02:36:30,279 INFO L795 eck$LassoCheckResult]: Loop: 1393#L17-4 assume true; 1426#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1419#L19-4 assume true; 1420#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1431#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 1436#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 1438#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 1437#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1427#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1428#L19-4 assume true; 1448#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1439#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 1393#L17-4 [2018-11-10 02:36:30,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 317140330, now seen corresponding path program 1 times [2018-11-10 02:36:30,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:30,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,284 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:30,284 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:30,284 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:30,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash 601476504, now seen corresponding path program 2 times [2018-11-10 02:36:30,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:30,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash -266132095, now seen corresponding path program 1 times [2018-11-10 02:36:30,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,358 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:30,359 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:30,359 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:30,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:36:30,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:36:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-10 02:36:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:36:30,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:36:30,483 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 02:36:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:30,545 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-10 02:36:30,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:36:30,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 89 transitions. [2018-11-10 02:36:30,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 02:36:30,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 67 states and 71 transitions. [2018-11-10 02:36:30,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 02:36:30,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 02:36:30,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2018-11-10 02:36:30,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:30,548 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 02:36:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2018-11-10 02:36:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-10 02:36:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 02:36:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 02:36:30,550 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 02:36:30,550 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 02:36:30,550 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 02:36:30,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-11-10 02:36:30,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 02:36:30,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:30,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:30,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:30,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:30,554 INFO L793 eck$LassoCheckResult]: Stem: 1701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1670#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 1671#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 1667#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 1668#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 1679#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1675#L69-5 assume true; 1676#L69-1 assume !!(q1_~i~1 < q1_~N~0); 1707#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 1680#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 1677#L69-5 assume true; 1678#L69-1 assume !!(q1_~i~1 < q1_~N~0); 1681#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 1682#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 1706#L69-5 assume true; 1684#L69-1 assume !(q1_~i~1 < q1_~N~0); 1672#L69-6 q1_~i~1 := 0; 1673#L70-3 assume true; 1689#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 1690#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 1698#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 1714#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 1713#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 1712#L73-2 havoc q1_#t~mem20; 1711#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 1699#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 1700#L70-3 assume true; 1691#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 1692#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 1696#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 1669#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 1666#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 1664#L73-2 havoc q1_#t~mem20; 1665#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 1674#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 1710#L70-3 assume true; 1709#L70-1 assume !(q1_~i~1 < q1_~N~0); 1662#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 1663#L17-4 [2018-11-10 02:36:30,555 INFO L795 eck$LassoCheckResult]: Loop: 1663#L17-4 assume true; 1693#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1685#L19-4 assume true; 1686#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1697#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 1702#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 1704#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 1703#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1694#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1695#L19-4 assume true; 1708#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1705#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 1663#L17-4 [2018-11-10 02:36:30,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 892721088, now seen corresponding path program 2 times [2018-11-10 02:36:30,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,559 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:30,563 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:30,563 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:30,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:36:30,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:36:30,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash 601476504, now seen corresponding path program 3 times [2018-11-10 02:36:30,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:30,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 801570519, now seen corresponding path program 2 times [2018-11-10 02:36:30,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:30,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:30,650 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:30,651 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:30,651 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:30,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 02:36:30,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 02:36:30,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:32,619 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 230 DAG size of output: 206 [2018-11-10 02:36:34,780 WARN L179 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 218 DAG size of output: 130 [2018-11-10 02:36:34,782 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:36:34,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:36:34,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:36:34,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:36:34,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:36:34,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:36:34,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:36:34,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:36:34,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration11_Lasso [2018-11-10 02:36:34,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:36:34,783 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:36:34,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:34,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,211 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2018-11-10 02:36:35,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:35,768 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-10 02:36:35,862 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:36:35,862 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:36:35,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:35,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:35,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:35,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:35,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:35,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:35,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:35,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:35,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:35,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:35,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:35,892 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:36:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:35,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:35,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:36:35,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:35,920 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:36:35,930 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:36:35,930 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:36:35,931 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:36:35,931 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:36:35,932 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:36:35,932 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~size, ULTIMATE.start_bubblesort_~a~0) = 1*ULTIMATE.start_bubblesort_~size - 1*ULTIMATE.start_bubblesort_~a~0 Supporting invariants [] [2018-11-10 02:36:35,981 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 02:36:35,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:36,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:36:36,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:36:36,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 02:36:36,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 74 states and 81 transitions. Complement of second has 6 states. [2018-11-10 02:36:36,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:36:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:36:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-10 02:36:36,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 38 letters. Loop has 12 letters. [2018-11-10 02:36:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:36,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 50 letters. Loop has 12 letters. [2018-11-10 02:36:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:36,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 38 letters. Loop has 24 letters. [2018-11-10 02:36:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:36,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 81 transitions. [2018-11-10 02:36:36,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:36,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 80 transitions. [2018-11-10 02:36:36,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 02:36:36,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 02:36:36,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 80 transitions. [2018-11-10 02:36:36,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:36,057 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-11-10 02:36:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 80 transitions. [2018-11-10 02:36:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-10 02:36:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 02:36:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-11-10 02:36:36,064 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-10 02:36:36,064 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-10 02:36:36,064 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 02:36:36,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 78 transitions. [2018-11-10 02:36:36,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:36,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:36,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:36,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:36,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:36,066 INFO L793 eck$LassoCheckResult]: Stem: 2062#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2024#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 2025#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 2021#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 2022#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 2033#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2029#L69-5 assume true; 2030#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2073#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2034#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2031#L69-5 assume true; 2032#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2035#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2036#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2072#L69-5 assume true; 2039#L69-1 assume !(q1_~i~1 < q1_~N~0); 2026#L69-6 q1_~i~1 := 0; 2027#L70-3 assume true; 2070#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2059#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2056#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2023#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2020#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2018#L73-2 havoc q1_#t~mem20; 2019#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2028#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2061#L70-3 assume true; 2049#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2050#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2060#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2080#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2079#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2078#L73-2 havoc q1_#t~mem20; 2077#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2076#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2075#L70-3 assume true; 2048#L70-1 assume !(q1_~i~1 < q1_~N~0); 2016#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 2017#L17-4 assume true; 2051#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2040#L19-4 [2018-11-10 02:36:36,066 INFO L795 eck$LassoCheckResult]: Loop: 2040#L19-4 assume true; 2041#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2057#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 2063#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 2067#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 2065#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2053#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2040#L19-4 [2018-11-10 02:36:36,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1088490619, now seen corresponding path program 1 times [2018-11-10 02:36:36,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,076 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:36,076 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:36,076 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:36,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:36,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1864317263, now seen corresponding path program 1 times [2018-11-10 02:36:36,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:36,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:36,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1609828683, now seen corresponding path program 1 times [2018-11-10 02:36:36,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:36,209 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:36,209 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:36,209 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:36,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:55,304 WARN L179 SmtUtils]: Spent 18.98 s on a formula simplification. DAG size of input: 238 DAG size of output: 209 [2018-11-10 02:36:57,329 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 208 DAG size of output: 133 [2018-11-10 02:36:57,331 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:36:57,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:36:57,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:36:57,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:36:57,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:36:57,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:36:57,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:36:57,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:36:57,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-10 02:36:57,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:36:57,332 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:36:57,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,775 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-11-10 02:36:57,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:57,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:36:58,134 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2018-11-10 02:36:58,676 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2018-11-10 02:36:58,737 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:36:58,738 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:36:58,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:58,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:58,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:58,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:36:58,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:36:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:36:58,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:36:58,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:36:58,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,764 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:36:58,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:36:58,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:36:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:36:58,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:36:58,769 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:36:58,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:36:58,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:36:58,772 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:36:58,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:36:58,793 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:36:58,816 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 02:36:58,816 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 02:36:58,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:36:58,817 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:36:58,817 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:36:58,817 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~item.offset, ULTIMATE.start_bubblesort_~b~0) = 1*ULTIMATE.start_bubblesort_~item.offset + 4*ULTIMATE.start_bubblesort_~b~0 Supporting invariants [] [2018-11-10 02:36:58,897 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 02:36:58,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:58,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:36:58,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:36:58,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:36:58,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 78 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-10 02:36:58,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 78 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 135 states and 150 transitions. Complement of second has 7 states. [2018-11-10 02:36:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:36:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:36:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-10 02:36:58,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 40 letters. Loop has 7 letters. [2018-11-10 02:36:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 47 letters. Loop has 7 letters. [2018-11-10 02:36:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 40 letters. Loop has 14 letters. [2018-11-10 02:36:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:36:58,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 150 transitions. [2018-11-10 02:36:58,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:58,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 92 states and 101 transitions. [2018-11-10 02:36:58,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 02:36:58,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 02:36:58,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 101 transitions. [2018-11-10 02:36:58,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:58,969 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-10 02:36:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 101 transitions. [2018-11-10 02:36:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-10 02:36:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 02:36:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-11-10 02:36:58,974 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-11-10 02:36:58,974 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-11-10 02:36:58,974 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 02:36:58,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 95 transitions. [2018-11-10 02:36:58,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:58,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:58,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:58,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:58,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:58,983 INFO L793 eck$LassoCheckResult]: Stem: 2483#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 2445#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 2441#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 2442#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 2453#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2449#L69-5 assume true; 2450#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2455#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2454#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2451#L69-5 assume true; 2452#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2499#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2498#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2497#L69-5 assume true; 2458#L69-1 assume !(q1_~i~1 < q1_~N~0); 2446#L69-6 q1_~i~1 := 0; 2447#L70-3 assume true; 2467#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2468#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2481#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2443#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2440#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2438#L73-2 havoc q1_#t~mem20; 2439#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2448#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2482#L70-3 assume true; 2469#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2470#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2476#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2477#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2504#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2503#L73-2 havoc q1_#t~mem20; 2502#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2501#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2500#L70-3 assume true; 2496#L70-1 assume !(q1_~i~1 < q1_~N~0); 2436#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 2437#L17-4 assume true; 2472#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2461#L19-4 assume true; 2462#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2513#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 2512#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 2489#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 2490#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2508#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2507#L19-4 assume true; 2505#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2494#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 2491#L17-4 assume true; 2471#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2459#L19-4 [2018-11-10 02:36:58,984 INFO L795 eck$LassoCheckResult]: Loop: 2459#L19-4 assume true; 2460#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2478#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 2484#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 2488#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 2486#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2473#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2459#L19-4 [2018-11-10 02:36:58,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1510125788, now seen corresponding path program 3 times [2018-11-10 02:36:58,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:58,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:36:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:58,993 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:58,993 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:58,993 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:59,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:36:59,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 02:36:59,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:36:59,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 02:36:59,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:36:59,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-10 02:36:59,094 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:36:59,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1864317263, now seen corresponding path program 2 times [2018-11-10 02:36:59,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:36:59,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:36:59,140 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-10 02:36:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:59,232 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2018-11-10 02:36:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:36:59,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 169 transitions. [2018-11-10 02:36:59,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:59,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 111 states and 119 transitions. [2018-11-10 02:36:59,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 02:36:59,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 02:36:59,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 119 transitions. [2018-11-10 02:36:59,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:59,236 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-10 02:36:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 119 transitions. [2018-11-10 02:36:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-11-10 02:36:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 02:36:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-10 02:36:59,239 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-10 02:36:59,239 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-10 02:36:59,239 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 02:36:59,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 108 transitions. [2018-11-10 02:36:59,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:59,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:59,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:59,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:59,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:59,241 INFO L793 eck$LassoCheckResult]: Stem: 2907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 2864#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 2859#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 2860#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 2873#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2869#L69-5 assume true; 2870#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2944#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2943#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2871#L69-5 assume true; 2872#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2876#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2874#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2875#L69-5 assume true; 2924#L69-1 assume !!(q1_~i~1 < q1_~N~0); 2940#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 2925#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 2923#L69-5 assume true; 2879#L69-1 assume !(q1_~i~1 < q1_~N~0); 2865#L69-6 q1_~i~1 := 0; 2866#L70-3 assume true; 2888#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2889#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2903#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2861#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2862#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2855#L73-2 havoc q1_#t~mem20; 2856#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2905#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2906#L70-3 assume true; 2946#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2904#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2899#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2900#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2857#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2858#L73-2 havoc q1_#t~mem20; 2867#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2868#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2918#L70-3 assume true; 2890#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 2891#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 2945#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 2942#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 2941#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 2939#L73-2 havoc q1_#t~mem20; 2938#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 2922#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 2921#L70-3 assume true; 2920#L70-1 assume !(q1_~i~1 < q1_~N~0); 2853#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 2854#L17-4 assume true; 2893#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2882#L19-4 assume true; 2883#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2902#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 2932#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 2930#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 2929#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2895#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2896#L19-4 assume true; 2926#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2919#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 2916#L17-4 assume true; 2892#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2880#L19-4 [2018-11-10 02:36:59,241 INFO L795 eck$LassoCheckResult]: Loop: 2880#L19-4 assume true; 2881#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2901#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 2908#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 2914#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 2911#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2894#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2880#L19-4 [2018-11-10 02:36:59,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash 80468632, now seen corresponding path program 4 times [2018-11-10 02:36:59,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,245 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:59,245 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:59,245 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:59,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 02:36:59,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 02:36:59,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:36:59,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:36:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 02:36:59,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:36:59,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-10 02:36:59,389 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:36:59,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1864317263, now seen corresponding path program 3 times [2018-11-10 02:36:59,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:36:59,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:36:59,468 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. cyclomatic complexity: 13 Second operand 9 states. [2018-11-10 02:36:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:36:59,569 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-11-10 02:36:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:36:59,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 138 transitions. [2018-11-10 02:36:59,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:59,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 127 states and 137 transitions. [2018-11-10 02:36:59,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 02:36:59,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 02:36:59,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 137 transitions. [2018-11-10 02:36:59,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:36:59,571 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-11-10 02:36:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 137 transitions. [2018-11-10 02:36:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-11-10 02:36:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 02:36:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-11-10 02:36:59,574 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-10 02:36:59,574 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-10 02:36:59,574 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 02:36:59,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 122 transitions. [2018-11-10 02:36:59,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 02:36:59,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:36:59,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:36:59,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:59,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:36:59,576 INFO L793 eck$LassoCheckResult]: Stem: 3346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_q1 } true;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; 3306#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := q1_~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc q1_~i~1;q1_#t~switch13 := false; 3302#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || false; 3303#L65 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13 || true; 3314#L68 assume q1_#t~switch13;q1_~i~1 := 0; 3310#L69-5 assume true; 3311#L69-1 assume !!(q1_~i~1 < q1_~N~0); 3317#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 3318#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 3312#L69-5 assume true; 3313#L69-1 assume !!(q1_~i~1 < q1_~N~0); 3322#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 3315#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 3316#L69-5 assume true; 3365#L69-1 assume !!(q1_~i~1 < q1_~N~0); 3369#L69-3 SUMMARY for call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L69-3 3367#L69-4 q1_#t~pre16 := q1_~i~1 + 1;q1_~i~1 := q1_~i~1 + 1;havoc q1_#t~pre16; 3364#L69-5 assume true; 3321#L69-1 assume !(q1_~i~1 < q1_~N~0); 3307#L69-6 q1_~i~1 := 0; 3308#L70-3 assume true; 3331#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 3332#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 3341#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 3304#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 3301#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 3299#L73-2 havoc q1_#t~mem20; 3300#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 3309#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 3345#L70-3 assume true; 3333#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 3334#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 3344#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 3375#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 3374#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 3373#L73-2 havoc q1_#t~mem20; 3372#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 3371#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 3370#L70-3 assume true; 3358#L70-1 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) != 0 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; 3368#L72 SUMMARY for call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L72 3366#L72-1 q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19; 3363#L73 SUMMARY for call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L73 3362#L73-1 SUMMARY for call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + q1_~i~1 * 4, 4); srcloc: L73-1 3361#L73-2 havoc q1_#t~mem20; 3360#L74 SUMMARY for call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + q1_~r~0 * 4, 4); srcloc: L74 3359#L74-1 q1_#t~post17 := q1_~i~1;q1_~i~1 := q1_#t~post17 + 1;havoc q1_#t~post17; 3357#L70-3 assume true; 3356#L70-1 assume !(q1_~i~1 < q1_~N~0); 3297#L60 havoc q1_#t~switch13;assume { :begin_inline_bubblesort } true;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; 3298#L17-4 assume true; 3353#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 3391#L19-4 assume true; 3390#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 3388#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 3386#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 3384#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 3381#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 3339#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 3325#L19-4 assume true; 3326#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 3343#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 3348#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 3352#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 3350#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 3340#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 3379#L19-4 assume true; 3376#L19-1 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 3355#L17-3 bubblesort_#t~pre0 := bubblesort_~a~0 + 1;bubblesort_~a~0 := bubblesort_~a~0 + 1;havoc bubblesort_#t~pre0; 3354#L17-4 assume true; 3335#L17-1 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 3323#L19-4 [2018-11-10 02:36:59,576 INFO L795 eck$LassoCheckResult]: Loop: 3323#L19-4 assume true; 3324#L19-1 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 3342#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size; 3347#L24 SUMMARY for call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + (bubblesort_~b~0 - 1) * 4, 4); srcloc: L24 3351#L24-1 SUMMARY for call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + bubblesort_~b~0 * 4, 4); srcloc: L24-1 3349#L24-2 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 3338#L19-3 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 3323#L19-4 [2018-11-10 02:36:59,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1188755558, now seen corresponding path program 5 times [2018-11-10 02:36:59,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,580 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:59,580 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:59,580 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:59,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 02:36:59,823 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 02:36:59,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1864317263, now seen corresponding path program 4 times [2018-11-10 02:36:59,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:36:59,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:36:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1101793974, now seen corresponding path program 6 times [2018-11-10 02:36:59,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:36:59,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:36:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:36:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:36:59,882 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 02:36:59,882 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 02:36:59,882 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718bc44a-3dd5-41b5-ba39-69200722555e/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 02:36:59,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 02:36:59,950 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-10 02:36:59,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 02:36:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:37:11,158 WARN L179 SmtUtils]: Spent 11.11 s on a formula simplification. DAG size of input: 354 DAG size of output: 295 [2018-11-10 02:40:18,922 WARN L179 SmtUtils]: Spent 3.11 m on a formula simplification. DAG size of input: 566 DAG size of output: 178 [2018-11-10 02:40:18,925 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:40:18,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:40:18,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:40:18,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:40:18,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:40:18,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:40:18,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:40:18,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:40:18,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration15_Lasso [2018-11-10 02:40:18,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:40:18,925 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:40:18,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:18,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,496 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2018-11-10 02:40:19,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:40:19,819 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:40:19,819 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:40:19,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:40:19,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:40:19,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:40:19,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,848 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:40:19,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:40:19,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:40:19,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:40:19,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:40:19,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:40:19,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:40:19,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:40:19,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:40:19,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:40:19,883 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:40:19,896 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 02:40:19,896 INFO L444 ModelExtractionUtils]: 23 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 02:40:19,897 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:40:19,897 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:40:19,897 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:40:19,897 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~b~0) = -2*ULTIMATE.start_bubblesort_~a~0 + 2*ULTIMATE.start_bubblesort_~b~0 + 1 Supporting invariants [] [2018-11-10 02:40:20,039 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-10 02:40:20,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:40:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:40:20,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:40:20,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-10 02:40:20,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 146 states and 159 transitions. Complement of second has 7 states. [2018-11-10 02:40:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:40:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:40:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-10 02:40:20,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 72 letters. Loop has 7 letters. [2018-11-10 02:40:20,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:40:20,138 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:40:20,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:40:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:40:20,185 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:40:20,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-10 02:40:20,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 146 states and 159 transitions. Complement of second has 7 states. [2018-11-10 02:40:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:40:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:40:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-10 02:40:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 72 letters. Loop has 7 letters. [2018-11-10 02:40:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:40:20,206 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:40:20,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:40:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:40:20,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:40:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:40:20,260 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:40:20,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-10 02:40:20,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 168 states and 185 transitions. Complement of second has 6 states. [2018-11-10 02:40:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:40:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:40:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-10 02:40:20,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 72 letters. Loop has 7 letters. [2018-11-10 02:40:20,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:40:20,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 79 letters. Loop has 7 letters. [2018-11-10 02:40:20,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:40:20,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 72 letters. Loop has 14 letters. [2018-11-10 02:40:20,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:40:20,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 185 transitions. [2018-11-10 02:40:20,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:40:20,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 0 states and 0 transitions. [2018-11-10 02:40:20,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:40:20,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:40:20,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:40:20,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:40:20,289 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:40:20,289 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:40:20,289 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:40:20,290 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 02:40:20,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:40:20,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:40:20,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:40:20,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:40:20 BoogieIcfgContainer [2018-11-10 02:40:20,296 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:40:20,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:40:20,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:40:20,296 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:40:20,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:54" (3/4) ... [2018-11-10 02:40:20,300 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:40:20,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:40:20,301 INFO L168 Benchmark]: Toolchain (without parser) took 266919.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.1 MB). Free memory was 959.7 MB in the beginning and 1.0 GB in the end (delta: -69.6 MB). Peak memory consumption was 352.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:40:20,302 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:40:20,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:40:20,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:40:20,302 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:40:20,303 INFO L168 Benchmark]: RCFGBuilder took 378.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:40:20,303 INFO L168 Benchmark]: BuchiAutomizer took 266292.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.9 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:40:20,304 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:40:20,307 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 943.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 378.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 266292.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.9 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (10 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -4 * i + -1 * a and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function size + -1 * a and consists of 4 locations. One deterministic module has affine ranking function item + 4 * b and consists of 4 locations. One nondeterministic module has affine ranking function -2 * a + 2 * b + 1 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 266.2s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 264.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 181 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 113 states and ocurred in iteration 14. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 569 SDtfs, 1138 SDslu, 807 SDs, 0 SdLazy, 654 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU3 SILI2 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital1028 mio100 ax100 hnf99 lsp102 ukn72 mio100 lsp52 div121 bol100 ite100 ukn100 eq165 hnf86 smp79 dnf168 smp90 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 606ms VariablesStem: 9 VariablesLoop: 10 DisjunctsStem: 3 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 42 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...