./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash af6d3df1a288680024c52d2d61adb02fdd276fce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:54:33,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:54:33,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:54:33,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:54:33,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:54:33,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:54:33,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:54:33,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:54:33,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:54:33,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:54:33,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:54:33,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:54:33,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:54:33,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:54:33,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:54:33,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:54:33,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:54:33,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:54:33,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:54:33,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:54:33,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:54:33,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:54:33,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:54:33,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:54:33,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:54:33,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:54:33,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:54:33,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:54:33,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:54:33,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:54:33,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:54:33,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:54:33,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:54:33,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:54:33,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:54:33,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:54:33,071 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:54:33,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:54:33,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:54:33,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:54:33,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:54:33,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:54:33,083 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:54:33,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:54:33,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:54:33,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:54:33,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:54:33,086 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:54:33,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:54:33,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:54:33,087 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:54:33,088 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:54:33,088 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_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af6d3df1a288680024c52d2d61adb02fdd276fce [2018-11-10 04:54:33,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:54:33,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:54:33,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:54:33,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:54:33,122 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:54:33,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-10 04:54:33,159 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/data/549d736ea/d23728a87470496db7dbdbdbea755682/FLAGe1a1b2f1a [2018-11-10 04:54:33,594 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:54:33,594 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2018-11-10 04:54:33,603 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/data/549d736ea/d23728a87470496db7dbdbdbea755682/FLAGe1a1b2f1a [2018-11-10 04:54:33,611 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/data/549d736ea/d23728a87470496db7dbdbdbea755682 [2018-11-10 04:54:33,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:54:33,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:54:33,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:33,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:54:33,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:54:33,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bac56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33, skipping insertion in model container [2018-11-10 04:54:33,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:54:33,657 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:54:33,853 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:33,860 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:54:33,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:33,919 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:54:33,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33 WrapperNode [2018-11-10 04:54:33,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:33,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:54:33,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:54:33,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:54:33,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:54:33,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:54:33,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:54:33,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:54:33,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:33,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:34,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:34,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... [2018-11-10 04:54:34,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:54:34,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:54:34,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:54:34,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:54:34,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/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 04:54:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:54:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:54:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:54:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:54:34,220 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:54:34,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:34 BoogieIcfgContainer [2018-11-10 04:54:34,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:54:34,221 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:54:34,222 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:54:34,224 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:54:34,224 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:54:34,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:54:33" (1/3) ... [2018-11-10 04:54:34,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d841335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:54:34, skipping insertion in model container [2018-11-10 04:54:34,225 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:54:34,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:33" (2/3) ... [2018-11-10 04:54:34,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d841335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:54:34, skipping insertion in model container [2018-11-10 04:54:34,226 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:54:34,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:34" (3/3) ... [2018-11-10 04:54:34,227 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-termination.c.i [2018-11-10 04:54:34,265 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:54:34,265 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:54:34,265 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:54:34,266 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:54:34,266 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:54:34,266 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:54:34,266 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:54:34,266 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:54:34,266 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:54:34,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 04:54:34,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:54:34,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:34,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:34,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:54:34,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:54:34,295 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:54:34,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 04:54:34,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:54:34,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:34,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:34,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:54:34,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:54:34,304 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 10#L558-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 9#L550-4true [2018-11-10 04:54:34,305 INFO L795 eck$LassoCheckResult]: Loop: 9#L550-4true assume true; 24#L550-1true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 7#L551-4true assume !true; 8#L550-3true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 9#L550-4true [2018-11-10 04:54:34,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-10 04:54:34,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1329512, now seen corresponding path program 1 times [2018-11-10 04:54:34,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:34,408 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 04:54:34,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:54:34,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:54:34,412 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:54:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:54:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:54:34,422 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 04:54:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:54:34,427 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-10 04:54:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:54:34,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-10 04:54:34,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:54:34,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 22 transitions. [2018-11-10 04:54:34,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:54:34,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 04:54:34,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 04:54:34,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:54:34,433 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:54:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 04:54:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 04:54:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 04:54:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 04:54:34,452 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:54:34,452 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 04:54:34,452 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:54:34,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 04:54:34,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:54:34,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:34,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:34,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:54:34,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:54:34,453 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 57#L558 assume !(main_~array_size~0 < 1); 58#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 61#L550-4 [2018-11-10 04:54:34,454 INFO L795 eck$LassoCheckResult]: Loop: 61#L550-4 assume true; 62#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 55#L551-4 assume true; 59#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 60#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 61#L550-4 [2018-11-10 04:54:34,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-10 04:54:34,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 41193125, now seen corresponding path program 1 times [2018-11-10 04:54:34,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:34,495 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 04:54:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:54:34,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:54:34,495 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:54:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:54:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:54:34,496 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 04:54:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:54:34,525 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 04:54:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:54:34,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 04:54:34,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:54:34,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:54:34,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 04:54:34,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:54:34,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 04:54:34,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:54:34,528 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:54:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 04:54:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 04:54:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 04:54:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-10 04:54:34,530 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:54:34,530 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 04:54:34,530 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:54:34,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-10 04:54:34,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 04:54:34,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:34,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:34,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 04:54:34,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:54:34,532 INFO L793 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 103#L558 assume !(main_~array_size~0 < 1); 104#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 106#L550-4 [2018-11-10 04:54:34,532 INFO L795 eck$LassoCheckResult]: Loop: 106#L550-4 assume true; 109#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 107#L551-4 assume true; 108#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 114#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 115#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 117#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 101#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 102#L551-4 assume true; 120#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 105#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 106#L550-4 [2018-11-10 04:54:34,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-10 04:54:34,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1946947997, now seen corresponding path program 1 times [2018-11-10 04:54:34,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash -595862727, now seen corresponding path program 1 times [2018-11-10 04:54:34,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:34,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:34,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:34,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:34,812 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:54:34,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:54:34,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:54:34,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:54:34,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:54:34,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:54:34,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:54:34,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:54:34,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 04:54:34,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:54:34,814 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:54:34,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 04:54:34,834 INFO 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 04:54:34,835 INFO 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 04:54:34,838 INFO 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 04:54:34,839 INFO 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 04:54:34,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 04:54:34,976 INFO 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 04:54:34,978 INFO 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 04:54:34,980 INFO 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 04:54:34,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:54:34,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:54:34,987 INFO 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 04:54:34,989 INFO 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 04:54:34,990 INFO 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 04:54:34,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:54:35,280 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:54:35,283 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:54:35,285 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 04:54:35,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:35,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:35,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:35,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,291 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 04:54:35,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:35,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:35,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:35,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,293 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 04:54:35,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,298 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 04:54:35,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,303 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 04:54:35,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,309 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 04:54:35,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,319 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 04:54:35,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,325 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 04:54:35,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:54:35,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,330 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:54:35,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,346 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 04:54:35,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,360 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 04:54:35,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:35,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:35,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:35,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,363 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 04:54:35,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:35,373 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 04:54:35,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:35,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:35,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:35,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:35,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:35,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:35,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:54:35,454 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:54:35,455 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:54:35,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:54:35,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:54:35,459 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:54:35,459 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2018-11-10 04:54:35,476 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 04:54:35,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:35,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:35,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:35,549 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 04:54:35,551 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 04:54:35,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 04:54:35,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 6 states. [2018-11-10 04:54:35,579 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 04:54:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:54:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 04:54:35,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 11 letters. [2018-11-10 04:54:35,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:35,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 11 letters. [2018-11-10 04:54:35,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:35,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 22 letters. [2018-11-10 04:54:35,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:35,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2018-11-10 04:54:35,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:35,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 43 transitions. [2018-11-10 04:54:35,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:54:35,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:54:35,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-11-10 04:54:35,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:54:35,585 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-10 04:54:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-11-10 04:54:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-10 04:54:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 04:54:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-10 04:54:35,587 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 04:54:35,587 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 04:54:35,587 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:54:35,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-10 04:54:35,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:35,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:35,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:35,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:54:35,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:54:35,589 INFO L793 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 249#L558 assume !(main_~array_size~0 < 1); 250#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 256#L550-4 assume true; 258#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 244#L551-4 [2018-11-10 04:54:35,589 INFO L795 eck$LassoCheckResult]: Loop: 244#L551-4 assume true; 251#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 265#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 266#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 271#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 243#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 244#L551-4 [2018-11-10 04:54:35,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-10 04:54:35,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 1 times [2018-11-10 04:54:35,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 577380690, now seen corresponding path program 1 times [2018-11-10 04:54:35,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:35,786 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:54:35,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:54:35,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:54:35,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:54:35,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:54:35,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:54:35,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:54:35,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:54:35,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 04:54:35,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:54:35,787 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:54:35,790 INFO 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 04:54:35,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 04:54:35,794 INFO 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 04:54:35,797 INFO 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 04:54:35,798 INFO 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 04:54:35,799 INFO 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 04:54:35,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 04:54:35,801 INFO 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 04:54:35,803 INFO 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 04:54:35,804 INFO 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 04:54:35,806 INFO 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 04:54:35,807 INFO 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 04:54:35,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 04:54:35,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 04:54:35,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 04:54:36,136 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:54:36,136 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:54:36,137 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 04:54:36,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:54:36,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,141 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 04:54:36,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:54:36,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,147 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 04:54:36,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:54:36,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:54:36,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,152 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 04:54:36,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,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 04:54:36,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,157 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 04:54:36,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,159 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 04:54:36,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,161 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 04:54:36,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,164 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 04:54:36,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:36,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:36,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:36,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,166 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 04:54:36,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,170 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 04:54:36,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,173 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 04:54:36,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,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 04:54:36,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,186 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 04:54:36,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,186 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:54:36,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:54:36,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:36,194 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 04:54:36,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:36,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:36,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:36,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:36,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:36,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:36,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:54:36,226 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:54:36,226 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:54:36,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:54:36,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:54:36,227 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:54:36,228 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~x.offset, v_rep(select #length ULTIMATE.start_sort_~x.base)_2) = -4*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~x.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_2 Supporting invariants [] [2018-11-10 04:54:36,251 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 04:54:36,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:54:36,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:36,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:36,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:36,307 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 04:54:36,307 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 04:54:36,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:54:36,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 95 states and 109 transitions. Complement of second has 7 states. [2018-11-10 04:54:36,354 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 04:54:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:54:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:54:36,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-10 04:54:36,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:36,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 04:54:36,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:36,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 04:54:36,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:36,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 109 transitions. [2018-11-10 04:54:36,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:36,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 55 states and 63 transitions. [2018-11-10 04:54:36,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:54:36,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 04:54:36,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-10 04:54:36,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:54:36,359 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-10 04:54:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-10 04:54:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-10 04:54:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 04:54:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 04:54:36,361 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 04:54:36,361 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 04:54:36,361 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:54:36,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 57 transitions. [2018-11-10 04:54:36,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:36,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:36,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:36,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:54:36,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:54:36,364 INFO L793 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 455#L558 assume !(main_~array_size~0 < 1); 456#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 462#L550-4 assume true; 463#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 458#L551-4 assume true; 459#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 476#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 477#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 481#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 491#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 490#L551-4 assume true; 487#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 460#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 461#L550-4 assume true; 465#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 453#L551-4 [2018-11-10 04:54:36,364 INFO L795 eck$LassoCheckResult]: Loop: 453#L551-4 assume true; 457#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 474#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 475#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 480#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 450#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 453#L551-4 [2018-11-10 04:54:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1393429858, now seen corresponding path program 2 times [2018-11-10 04:54:36,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:36,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:36,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:54:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:36,422 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 04:54:36,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:54:36,422 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bef816b4-d0c5-4b0b-b179-bbe48bdce117/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:54:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:54:36,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:54:36,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:54:36,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:36,479 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 04:54:36,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:54:36,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:54:36,505 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:54:36,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 2 times [2018-11-10 04:54:36,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:54:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:54:36,552 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 04:54:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:54:36,614 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-10 04:54:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:54:36,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 138 transitions. [2018-11-10 04:54:36,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:36,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 132 transitions. [2018-11-10 04:54:36,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 04:54:36,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 04:54:36,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 132 transitions. [2018-11-10 04:54:36,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:54:36,620 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-11-10 04:54:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 132 transitions. [2018-11-10 04:54:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2018-11-10 04:54:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 04:54:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-10 04:54:36,627 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 04:54:36,627 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-10 04:54:36,627 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:54:36,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2018-11-10 04:54:36,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 04:54:36,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:54:36,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:54:36,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 04:54:36,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:54:36,629 INFO L793 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 693#L558 assume !(main_~array_size~0 < 1); 694#L558-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_sort } true;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 700#L550-4 assume true; 701#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 724#L551-4 assume true; 740#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 741#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 756#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 731#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 730#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 696#L551-4 assume true; 697#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 752#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 717#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 718#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 692#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 728#L551-4 assume true; 725#L551-1 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 698#L550-3 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := sort_#t~post2 + 1;havoc sort_#t~post2; 699#L550-4 assume true; 703#L550-1 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 687#L551-4 [2018-11-10 04:54:36,629 INFO L795 eck$LassoCheckResult]: Loop: 687#L551-4 assume true; 695#L551-1 assume !!(sort_~i~0 < sort_~n - sort_~pass~0); 710#L552 SUMMARY for call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + sort_~i~0 * 4, 4); srcloc: L552 711#L552-1 SUMMARY for call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + (sort_~i~0 + 1) * 4, 4); srcloc: L552-1 716#L552-2 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 686#L551-3 sort_#t~post3 := sort_~i~0;sort_~i~0 := sort_#t~post3 + 1;havoc sort_#t~post3; 687#L551-4 [2018-11-10 04:54:36,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1931896682, now seen corresponding path program 3 times [2018-11-10 04:54:36,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1543143369, now seen corresponding path program 3 times [2018-11-10 04:54:36,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1623026530, now seen corresponding path program 4 times [2018-11-10 04:54:36,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:54:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:54:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:54:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:54:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:54:36,902 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-11-10 04:54:36,952 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:54:36,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:54:36,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:54:36,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:54:36,953 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:54:36,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:54:36,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:54:36,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:54:36,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 04:54:36,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:54:36,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:54:36,956 INFO 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 04:54:36,964 INFO 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 04:54:36,966 INFO 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 04:54:36,968 INFO 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 04:54:36,970 INFO 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 04:54:36,971 INFO 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 04:54:36,973 INFO 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 04:54:36,975 INFO 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 04:54:36,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:54:36,978 INFO 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 04:54:36,980 INFO 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 04:54:37,120 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-11-10 04:54:37,164 INFO 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 04:54:37,167 INFO 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 04:54:37,169 INFO 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 04:54:37,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 04:54:37,431 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:54:37,431 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:54:37,432 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 04:54:37,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,434 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 04:54:37,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,437 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 04:54:37,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,439 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 04:54:37,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,441 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 04:54:37,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,443 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 04:54:37,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,446 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 04:54:37,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,448 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 04:54:37,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,450 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 04:54:37,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,452 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 04:54:37,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:54:37,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:54:37,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:54:37,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,454 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 04:54:37,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,458 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 04:54:37,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,461 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 04:54:37,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,466 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 04:54:37,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,469 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 04:54:37,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,469 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:54:37,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,471 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:54:37,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,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 04:54:37,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:54:37,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 04:54:37,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:54:37,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:54:37,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:54:37,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:54:37,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:54:37,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:54:37,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:54:37,510 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:54:37,510 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:54:37,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:54:37,511 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:54:37,512 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:54:37,512 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~x.offset, v_rep(select #length ULTIMATE.start_sort_~x.base)_3) = -4*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~x.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 Supporting invariants [] [2018-11-10 04:54:37,548 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 04:54:37,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:54:37,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,584 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 04:54:37,584 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 04:54:37,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:54:37,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 04:54:37,610 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 04:54:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:54:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:54:37,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:54:37,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:37,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:54:37,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,645 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 04:54:37,645 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 04:54:37,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:54:37,663 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 105 states and 118 transitions. Complement of second has 7 states. [2018-11-10 04:54:37,665 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 04:54:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:54:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 04:54:37,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:54:37,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:37,666 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:54:37,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:37,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:54:37,708 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 04:54:37,709 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 04:54:37,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 04:54:37,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 136 states and 154 transitions. Complement of second has 6 states. [2018-11-10 04:54:37,731 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 04:54:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:54:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-10 04:54:37,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 04:54:37,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:37,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 04:54:37,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:37,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 04:54:37,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:54:37,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 154 transitions. [2018-11-10 04:54:37,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:54:37,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 0 states and 0 transitions. [2018-11-10 04:54:37,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:54:37,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:54:37,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:54:37,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:54:37,736 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:54:37,736 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:54:37,736 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:54:37,736 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:54:37,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:54:37,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:54:37,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:54:37,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:54:37 BoogieIcfgContainer [2018-11-10 04:54:37,744 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:54:37,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:54:37,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:54:37,744 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:54:37,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:34" (3/4) ... [2018-11-10 04:54:37,747 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:54:37,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:54:37,748 INFO L168 Benchmark]: Toolchain (without parser) took 4133.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 956.6 MB in the beginning and 933.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:54:37,749 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:54:37,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:54:37,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:54:37,750 INFO L168 Benchmark]: Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:54:37,750 INFO L168 Benchmark]: RCFGBuilder took 215.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:54:37,751 INFO L168 Benchmark]: BuchiAutomizer took 3522.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 933.4 MB in the end (delta: 188.2 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:54:37,751 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 933.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:54:37,754 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -211.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3522.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 933.4 MB in the end (delta: 188.2 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 933.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 146 SDtfs, 196 SDslu, 91 SDs, 0 SdLazy, 149 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax112 hnf99 lsp84 ukn98 mio100 lsp54 div100 bol100 ite100 ukn100 eq185 hnf87 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...