./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:19:26,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:19:26,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:19:26,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:19:26,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:19:26,320 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:19:26,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:19:26,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:19:26,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:19:26,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:19:26,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:19:26,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:19:26,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:19:26,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:19:26,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:19:26,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:19:26,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:19:26,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:19:26,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:19:26,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:19:26,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:19:26,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:19:26,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:19:26,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:19:26,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:19:26,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:19:26,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:19:26,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:19:26,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:19:26,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:19:26,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:19:26,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:19:26,332 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:19:26,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:19:26,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:19:26,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:19:26,333 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 04:19:26,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:19:26,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:19:26,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:19:26,341 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:19:26,342 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 04:19:26,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:19:26,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 04:19:26,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:19:26,343 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 04:19:26,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:19:26,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:19:26,344 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 04:19:26,344 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 04:19:26,344 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_f0e78974-cf46-4304-bf26-c07a148901e6/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2018-12-02 04:19:26,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:19:26,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:19:26,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:19:26,370 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:19:26,370 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:19:26,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-02 04:19:26,405 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/data/af3ac563a/4da3ee5f68ba46909947c6aae2283855/FLAGf32684bb5 [2018-12-02 04:19:26,808 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:19:26,808 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-02 04:19:26,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/data/af3ac563a/4da3ee5f68ba46909947c6aae2283855/FLAGf32684bb5 [2018-12-02 04:19:26,822 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/data/af3ac563a/4da3ee5f68ba46909947c6aae2283855 [2018-12-02 04:19:26,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:19:26,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:19:26,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:19:26,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:19:26,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:19:26,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:26" (1/1) ... [2018-12-02 04:19:26,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48195145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:26, skipping insertion in model container [2018-12-02 04:19:26,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:19:26" (1/1) ... [2018-12-02 04:19:26,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:19:26,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:19:26,988 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:19:27,025 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:19:27,047 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:19:27,066 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:19:27,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27 WrapperNode [2018-12-02 04:19:27,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:19:27,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:19:27,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:19:27,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:19:27,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:19:27,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:19:27,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:19:27,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:19:27,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... [2018-12-02 04:19:27,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:19:27,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:19:27,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:19:27,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:19:27,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:19:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:19:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:19:27,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:19:27,266 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 04:19:27,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:27 BoogieIcfgContainer [2018-12-02 04:19:27,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:19:27,267 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 04:19:27,267 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 04:19:27,270 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 04:19:27,271 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:19:27,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 04:19:26" (1/3) ... [2018-12-02 04:19:27,272 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ca3ada8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:19:27, skipping insertion in model container [2018-12-02 04:19:27,272 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:19:27,272 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:19:27" (2/3) ... [2018-12-02 04:19:27,272 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ca3ada8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:19:27, skipping insertion in model container [2018-12-02 04:19:27,272 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:19:27,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:27" (3/3) ... [2018-12-02 04:19:27,274 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-02 04:19:27,308 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:19:27,309 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 04:19:27,309 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 04:19:27,309 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 04:19:27,309 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:19:27,309 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:19:27,309 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 04:19:27,309 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:19:27,309 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 04:19:27,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 04:19:27,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:27,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:27,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:27,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 04:19:27,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:27,340 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 04:19:27,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 04:19:27,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:27,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:27,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:27,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 04:19:27,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:27,348 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2018-12-02 04:19:27,349 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2018-12-02 04:19:27,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 04:19:27,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:27,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-02 04:19:27,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:27,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-02 04:19:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:27,697 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-02 04:19:27,868 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-12-02 04:19:27,927 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:19:27,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:19:27,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:19:27,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:19:27,928 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:19:27,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:19:27,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:19:27,928 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:19:27,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 04:19:27,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:19:27,929 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:19:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,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-12-02 04:19:27,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,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-12-02 04:19:27,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,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-12-02 04:19:27,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-12-02 04:19:27,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:27,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-12-02 04:19:27,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-12-02 04:19:27,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-12-02 04:19:28,147 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-02 04:19:28,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:28,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:19:28,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:19:28,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:28,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:28,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:28,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,584 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:28,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,585 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:28,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,597 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:28,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,598 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:28,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,611 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:28,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:28,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:28,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:28,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:28,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:28,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:28,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:28,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:28,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:28,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:19:28,659 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 04:19:28,659 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:19:28,660 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:19:28,661 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:19:28,661 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:19:28,661 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-12-02 04:19:28,727 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 04:19:28,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 04:19:28,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 04:19:28,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 04:19:28,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:28,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:28,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:28,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 04:19:28,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-12-02 04:19:28,917 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2018-12-02 04:19:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 04:19:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:19:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-02 04:19:28,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 04:19:28,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:28,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 04:19:28,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:28,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 04:19:28,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:28,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-12-02 04:19:28,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:28,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2018-12-02 04:19:28,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 04:19:28,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 04:19:28,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-12-02 04:19:28,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:19:28,929 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-02 04:19:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-12-02 04:19:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 04:19:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 04:19:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-02 04:19:28,945 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-02 04:19:28,945 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-02 04:19:28,945 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 04:19:28,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-02 04:19:28,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:28,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:28,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:28,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:19:28,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:28,947 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2018-12-02 04:19:28,947 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2018-12-02 04:19:28,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2018-12-02 04:19:28,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:28,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:28,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:19:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:19:28,981 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:19:28,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-02 04:19:28,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:28,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:28,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,144 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-02 04:19:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:19:29,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:19:29,185 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 04:19:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:19:29,195 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-12-02 04:19:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:19:29,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-12-02 04:19:29,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2018-12-02 04:19:29,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 04:19:29,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 04:19:29,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-12-02 04:19:29,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:19:29,198 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-02 04:19:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-12-02 04:19:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 04:19:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 04:19:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-02 04:19:29,199 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-02 04:19:29,200 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-02 04:19:29,200 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 04:19:29,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-12-02 04:19:29,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:29,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:29,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:19:29,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:29,201 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2018-12-02 04:19:29,201 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2018-12-02 04:19:29,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2018-12-02 04:19:29,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:29,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:19:29,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:19:29,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:19:29,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-12-02 04:19:29,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,385 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-02 04:19:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:19:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:19:29,419 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 04:19:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:19:29,431 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-12-02 04:19:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:19:29,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-12-02 04:19:29,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-12-02 04:19:29,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 04:19:29,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 04:19:29,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-02 04:19:29,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:19:29,433 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 04:19:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-02 04:19:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-02 04:19:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 04:19:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-02 04:19:29,435 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 04:19:29,435 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 04:19:29,435 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 04:19:29,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-02 04:19:29,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:29,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:29,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:19:29,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:29,436 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2018-12-02 04:19:29,436 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2018-12-02 04:19:29,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-02 04:19:29,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:29,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2018-12-02 04:19:29,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-12-02 04:19:29,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:19:29,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0e78974-cf46-4304-bf26-c07a148901e6/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-12-02 04:19:29,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:29,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 04:19:29,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-02 04:19:29,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:29,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 52 [2018-12-02 04:19:29,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:29,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 04:19:29,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-02 04:19:29,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 04:19:29,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 04:19:29,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 04:19:29,617 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,646 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:18 [2018-12-02 04:19:29,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 04:19:29,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 04:19:29,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 04:19:29,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:29,668 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-02 04:19:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:19:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-12-02 04:19:29,820 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-02 04:19:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:19:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:19:29,851 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-02 04:19:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:19:29,889 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-02 04:19:29,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:19:29,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-12-02 04:19:29,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-12-02 04:19:29,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 04:19:29,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 04:19:29,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-12-02 04:19:29,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:19:29,891 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-02 04:19:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-12-02 04:19:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-02 04:19:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 04:19:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-02 04:19:29,892 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-02 04:19:29,892 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-02 04:19:29,892 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 04:19:29,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-12-02 04:19:29,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:29,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:29,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:29,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 04:19:29,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:29,892 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 408#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-12-02 04:19:29,893 INFO L796 eck$LassoCheckResult]: Loop: 409#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 410#L554-3 main_#t~short12 := main_#t~short10; 416#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 403#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 404#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-12-02 04:19:29,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 04:19:29,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2018-12-02 04:19:29,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2018-12-02 04:19:29,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:29,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:19:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:30,085 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-12-02 04:19:30,197 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-02 04:19:30,384 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 04:19:30,613 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-02 04:19:30,617 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:19:30,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:19:30,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:19:30,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:19:30,618 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:19:30,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:19:30,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:19:30,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:19:30,618 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 04:19:30,618 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:19:30,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:19:30,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:30,955 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-12-02 04:19:31,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:31,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:19:31,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:19:31,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:31,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:31,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:31,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:31,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:31,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:31,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:31,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:31,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:31,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:31,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:31,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:31,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:31,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:31,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:31,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,433 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:31,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,434 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:31,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:31,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,437 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:31,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,437 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:31,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,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-12-02 04:19:31,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:31,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:31,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-12-02 04:19:31,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:31,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:31,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:31,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:31,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:31,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:31,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:19:31,446 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:19:31,446 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:19:31,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:19:31,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:19:31,448 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:19:31,448 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-12-02 04:19:31,511 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 04:19:31,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 04:19:31,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:31,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:31,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 04:19:31,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 04:19:31,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-02 04:19:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:31,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:31,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-02 04:19:31,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 04:19:31,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-02 04:19:31,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 04:19:31,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-02 04:19:31,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-02 04:19:31,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:31,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:31,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-02 04:19:31,697 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 04:19:31,726 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:31,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:31,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:31,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 04:19:31,765 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-02 04:19:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:31,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 04:19:31,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-02 04:19:31,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2018-12-02 04:19:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 04:19:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:19:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-02 04:19:31,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 04:19:31,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:31,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 04:19:31,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:31,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2018-12-02 04:19:31,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:31,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-12-02 04:19:31,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:31,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2018-12-02 04:19:31,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 04:19:31,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 04:19:31,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-12-02 04:19:31,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:19:31,850 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-02 04:19:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-12-02 04:19:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-02 04:19:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 04:19:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 04:19:31,851 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:19:31,851 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:19:31,851 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 04:19:31,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-12-02 04:19:31,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-02 04:19:31,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:19:31,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:19:31,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:19:31,852 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:19:31,852 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 620#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 621#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 625#L554-3 main_#t~short12 := main_#t~short10; 628#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 617#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 618#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 622#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-12-02 04:19:31,852 INFO L796 eck$LassoCheckResult]: Loop: 623#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 624#L554-3 main_#t~short12 := main_#t~short10; 627#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 615#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 616#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 629#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-12-02 04:19:31,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-12-02 04:19:31,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:31,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:31,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-12-02 04:19:31,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:31,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2018-12-02 04:19:31,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:19:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:19:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:19:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:19:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:19:32,082 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-12-02 04:19:32,191 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-02 04:19:32,864 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 124 [2018-12-02 04:19:33,390 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-02 04:19:33,393 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:19:33,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:19:33,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:19:33,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:19:33,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:19:33,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:19:33,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:19:33,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:19:33,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-02 04:19:33,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:19:33,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:19:33,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,790 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-12-02 04:19:33,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:33,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:19:34,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:19:34,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:19:34,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,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-12-02 04:19:34,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,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-12-02 04:19:34,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,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-12-02 04:19:34,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:19:34,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:19:34,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:19:34,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,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-12-02 04:19:34,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,309 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:34,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,309 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:19:34,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:19:34,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:19:34,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:19:34,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:19:34,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:19:34,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:19:34,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:19:34,332 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:19:34,332 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 04:19:34,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:19:34,336 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 04:19:34,336 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 04:19:34,402 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:19:34,422 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:19:34,422 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:19:34,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:19:34,423 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 04:19:34,423 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:19:34,423 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2018-12-02 04:19:34,497 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-02 04:19:34,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 04:19:34,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:34,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:34,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 04:19:34,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 04:19:34,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-02 04:19:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:34,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:34,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-02 04:19:34,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 04:19:34,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-02 04:19:34,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 04:19:34,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-02 04:19:34,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-02 04:19:34,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-02 04:19:34,677 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,692 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 04:19:34,731 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-02 04:19:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:34,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 04:19:34,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-02 04:19:34,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-12-02 04:19:34,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 04:19:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:19:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-02 04:19:34,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 04:19:34,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:34,797 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:19:34,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:34,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:34,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 04:19:34,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 04:19:34,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-02 04:19:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:34,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:34,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-02 04:19:34,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 04:19:34,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-02 04:19:34,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 04:19:34,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-02 04:19:34,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-02 04:19:34,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:34,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:34,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-02 04:19:34,959 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:34,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 04:19:35,022 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-02 04:19:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:35,055 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 04:19:35,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-02 04:19:35,087 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-12-02 04:19:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 04:19:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:19:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-02 04:19:35,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 04:19:35,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:35,087 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:19:35,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:19:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:35,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:35,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 04:19:35,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 04:19:35,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-02 04:19:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:19:35,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:19:35,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-02 04:19:35,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-02 04:19:35,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-02 04:19:35,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 04:19:35,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-02 04:19:35,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:19:35,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2018-12-02 04:19:35,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 04:19:35,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 04:19:35,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:19:35,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 04:19:35,318 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-02 04:19:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:19:35,352 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-02 04:19:35,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-02 04:19:35,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2018-12-02 04:19:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 04:19:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:19:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-02 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-02 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-02 04:19:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:19:35,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-12-02 04:19:35,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:19:35,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-12-02 04:19:35,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 04:19:35,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 04:19:35,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 04:19:35,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:19:35,393 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:19:35,393 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:19:35,394 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:19:35,394 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 04:19:35,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:19:35,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:19:35,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 04:19:35,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 04:19:35 BoogieIcfgContainer [2018-12-02 04:19:35,398 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 04:19:35,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:19:35,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:19:35,398 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:19:35,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:19:27" (3/4) ... [2018-12-02 04:19:35,400 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:19:35,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:19:35,401 INFO L168 Benchmark]: Toolchain (without parser) took 8577.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -257.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:19:35,401 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:19:35,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:19:35,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:19:35,402 INFO L168 Benchmark]: Boogie Preprocessor took 13.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:19:35,402 INFO L168 Benchmark]: RCFGBuilder took 161.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:19:35,402 INFO L168 Benchmark]: BuchiAutomizer took 8130.51 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.2 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:19:35,403 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:19:35,404 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8130.51 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.2 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 46 SDslu, 46 SDs, 0 SdLazy, 136 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1016 mio100 ax103 hnf99 lsp64 ukn53 mio100 lsp30 div100 bol104 ite100 ukn100 eq171 hnf88 smp97 dnf220 smp66 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 91ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...