./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/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 0d5c046770a708e0857845f9429def45b08d1347 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:29,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:29,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:29,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:29,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:29,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:29,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:29,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:29,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:29,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:29,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:29,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:29,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:29,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:29,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:29,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:29,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:29,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:29,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:29,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:29,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:29,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:29,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:29,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:29,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:29,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:29,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:29,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:29,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:29,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:29,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:29,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:29,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:29,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:29,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:29,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:29,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:29,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:29,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:29,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:29,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:29,087 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:29,087 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:29,087 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:29,087 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:29,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:29,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:29,089 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:29,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:29,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:29,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:29,090 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:29,090 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:29,090 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:29,090 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:29,091 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:29,091 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_b7fa81c9-255b-402a-aa8f-0d38528827bb/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 -> 0d5c046770a708e0857845f9429def45b08d1347 [2018-11-18 08:34:29,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:29,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:29,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:29,130 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:29,130 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:29,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-18 08:34:29,176 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/data/c24d39d92/5f2962872d6c4013bb883ae99a0510af/FLAG2014d06b1 [2018-11-18 08:34:29,530 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:29,530 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-18 08:34:29,542 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/data/c24d39d92/5f2962872d6c4013bb883ae99a0510af/FLAG2014d06b1 [2018-11-18 08:34:29,940 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/data/c24d39d92/5f2962872d6c4013bb883ae99a0510af [2018-11-18 08:34:29,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:29,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:29,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:29,952 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:29,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266329ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:29,997 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:30,172 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:30,179 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:30,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:30,288 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:30,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30 WrapperNode [2018-11-18 08:34:30,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:30,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:30,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:30,290 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:30,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:30,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:30,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:30,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:30,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:30,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:30,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fa81c9-255b-402a-aa8f-0d38528827bb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:30,506 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:30,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30 BoogieIcfgContainer [2018-11-18 08:34:30,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:30,507 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:30,507 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:30,509 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:30,510 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:29" (1/3) ... [2018-11-18 08:34:30,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d517938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:30, skipping insertion in model container [2018-11-18 08:34:30,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (2/3) ... [2018-11-18 08:34:30,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d517938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:30, skipping insertion in model container [2018-11-18 08:34:30,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30" (3/3) ... [2018-11-18 08:34:30,513 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-18 08:34:30,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:30,548 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:30,548 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:30,548 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:30,548 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:30,548 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:30,548 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:30,549 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:30,549 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:30,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 08:34:30,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:30,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:30,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,577 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:30,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 08:34:30,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:30,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:30,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:30,584 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 12#L552-2true [2018-11-18 08:34:30,585 INFO L796 eck$LassoCheckResult]: Loop: 12#L552-2true assume true; 13#L551-1true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 15#L551-2true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4#L551-4true main_#t~short9 := main_#t~short7; 5#L551-5true assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-7true assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 10#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 12#L552-2true [2018-11-18 08:34:30,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:34:30,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 1 times [2018-11-18 08:34:30,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 263851596, now seen corresponding path program 1 times [2018-11-18 08:34:30,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,945 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-18 08:34:31,124 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:31,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:31,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:31,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:31,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:31,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:31,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:31,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:31,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 08:34:31,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:31,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:31,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:31,726 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:31,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:31,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:31,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,813 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:31,817 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:31,817 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:31,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:31,819 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:31,820 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:31,820 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-18 08:34:31,890 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:31,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:31,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:31,985 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 08:34:31,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-18 08:34:32,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 58 states and 73 transitions. Complement of second has 10 states. [2018-11-18 08:34:32,102 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-11-18 08:34:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-18 08:34:32,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 08:34:32,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 08:34:32,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 08:34:32,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:32,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-11-18 08:34:32,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 08:34:32,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 34 states and 46 transitions. [2018-11-18 08:34:32,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 08:34:32,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 08:34:32,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2018-11-18 08:34:32,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:32,116 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2018-11-18 08:34:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2018-11-18 08:34:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-18 08:34:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 08:34:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-18 08:34:32,135 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-18 08:34:32,135 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-18 08:34:32,135 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:32,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-11-18 08:34:32,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 08:34:32,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:34:32,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,136 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 232#L552-2 assume true; 251#L551-1 [2018-11-18 08:34:32,136 INFO L796 eck$LassoCheckResult]: Loop: 251#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 256#L551-2 assume !main_#t~short7; 234#L551-4 main_#t~short9 := main_#t~short7; 235#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 242#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 248#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 252#L552-2 assume true; 251#L551-1 [2018-11-18 08:34:32,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 08:34:32,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash 639499098, now seen corresponding path program 1 times [2018-11-18 08:34:32,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:32,198 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:32,200 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-18 08:34:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,219 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 08:34:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:32,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2018-11-18 08:34:32,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:32,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 26 transitions. [2018-11-18 08:34:32,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 08:34:32,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 08:34:32,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-18 08:34:32,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:32,222 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 08:34:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-18 08:34:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 08:34:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 08:34:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-18 08:34:32,223 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 08:34:32,223 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 08:34:32,223 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:32,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-18 08:34:32,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:32,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:32,224 INFO L794 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 309#L552-2 assume true; 323#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 324#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 310#L551-4 main_#t~short9 := main_#t~short7; 311#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 319#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 316#L552-2 [2018-11-18 08:34:32,224 INFO L796 eck$LassoCheckResult]: Loop: 316#L552-2 assume true; 321#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 326#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 327#L551-4 main_#t~short9 := main_#t~short7; 330#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 329#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 328#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 316#L552-2 [2018-11-18 08:34:32,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 263851598, now seen corresponding path program 1 times [2018-11-18 08:34:32,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 2 times [2018-11-18 08:34:32,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -305913503, now seen corresponding path program 1 times [2018-11-18 08:34:32,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,447 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-18 08:34:32,734 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 100 [2018-11-18 08:34:32,811 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:32,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:32,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:32,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:32,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:32,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:32,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:32,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:32,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 08:34:32,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:32,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:32,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,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-11-18 08:34:33,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-11-18 08:34:33,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:33,312 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:33,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-11-18 08:34:33,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,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-11-18 08:34:33,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,346 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:33,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:33,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,382 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:33,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,383 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:33,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,399 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:33,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,400 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:33,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,428 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:33,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:33,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,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-11-18 08:34:33,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,460 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:33,463 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:33,463 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:33,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:33,464 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:33,465 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:33,465 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-18 08:34:33,544 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:33,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:33,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,593 INFO L477 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-11-18 08:34:33,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,607 INFO L477 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-11-18 08:34:33,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-18 08:34:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,698 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:34:33,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 08:34:33,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 37 states and 42 transitions. Complement of second has 10 states. [2018-11-18 08:34:33,772 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-11-18 08:34:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-18 08:34:33,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 08:34:33,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 08:34:33,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-18 08:34:33,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-18 08:34:33,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:33,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2018-11-18 08:34:33,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 08:34:33,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 08:34:33,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2018-11-18 08:34:33,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:33,782 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-18 08:34:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2018-11-18 08:34:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 08:34:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 08:34:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-18 08:34:33,785 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-18 08:34:33,785 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-18 08:34:33,785 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:33,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 42 transitions. [2018-11-18 08:34:33,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 08:34:33,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1] [2018-11-18 08:34:33,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,788 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 548#L552-2 assume true; 573#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 572#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 571#L551-4 main_#t~short9 := main_#t~short7; 570#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 569#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 568#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 567#L552-2 assume true; 563#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 564#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 549#L551-4 main_#t~short9 := main_#t~short7; 550#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 558#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 554#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 555#L552-2 [2018-11-18 08:34:33,788 INFO L796 eck$LassoCheckResult]: Loop: 555#L552-2 assume true; 560#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 583#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 582#L551-4 main_#t~short9 := main_#t~short7; 581#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 580#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 578#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 555#L552-2 [2018-11-18 08:34:33,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash -305913501, now seen corresponding path program 2 times [2018-11-18 08:34:33,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 3 times [2018-11-18 08:34:33,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1279745196, now seen corresponding path program 2 times [2018-11-18 08:34:33,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:34,020 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-18 08:34:34,590 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 131 [2018-11-18 08:34:34,751 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 08:34:34,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:34,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:34,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:34,754 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:34,754 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:34,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:34,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:34,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:34,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 08:34:34,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:34,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:34,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:34,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:35,256 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:35,256 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:35,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,269 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:35,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,269 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:35,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:35,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:35,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:35,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,297 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:35,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,298 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:35,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,302 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:35,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,303 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:35,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,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-11-18 08:34:35,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:35,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:35,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:35,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:35,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:35,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:35,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:35,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:35,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:35,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:35,334 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:35,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:35,335 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:35,335 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:35,335 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-18 08:34:35,408 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:35,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:35,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,446 INFO L477 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-11-18 08:34:35,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,460 INFO L477 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-11-18 08:34:35,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-18 08:34:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:35,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:34:35,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 08:34:35,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 49 states and 56 transitions. Complement of second has 10 states. [2018-11-18 08:34:35,544 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-11-18 08:34:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-18 08:34:35,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 08:34:35,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,544 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:35,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,588 INFO L477 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-11-18 08:34:35,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,602 INFO L477 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-11-18 08:34:35,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-18 08:34:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:35,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 08:34:35,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 08:34:35,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 49 states and 56 transitions. Complement of second has 10 states. [2018-11-18 08:34:35,690 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-11-18 08:34:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-18 08:34:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 08:34:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,691 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:35,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,730 INFO L477 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-11-18 08:34:35,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:35,744 INFO L477 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-11-18 08:34:35,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:35,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-18 08:34:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:35,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:35,787 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 3 loop predicates [2018-11-18 08:34:35,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-18 08:34:35,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 42 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 56 states and 64 transitions. Complement of second has 9 states. [2018-11-18 08:34:35,846 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-11-18 08:34:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:34:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-18 08:34:35,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 08:34:35,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-18 08:34:35,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-18 08:34:35,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:35,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2018-11-18 08:34:35,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:35,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 44 states and 50 transitions. [2018-11-18 08:34:35,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 08:34:35,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 08:34:35,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-11-18 08:34:35,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:35,851 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-18 08:34:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-11-18 08:34:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 16. [2018-11-18 08:34:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 08:34:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-18 08:34:35,853 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 08:34:35,853 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 08:34:35,853 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:35,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-18 08:34:35,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:35,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:35,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:35,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:35,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:35,854 INFO L794 eck$LassoCheckResult]: Stem: 1115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1110#L552-2 [2018-11-18 08:34:35,854 INFO L796 eck$LassoCheckResult]: Loop: 1110#L552-2 assume true; 1121#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1123#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1111#L551-4 main_#t~short9 := main_#t~short7; 1112#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1119#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1116#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1110#L552-2 [2018-11-18 08:34:35,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 08:34:35,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:35,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445232, now seen corresponding path program 1 times [2018-11-18 08:34:35,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 263851598, now seen corresponding path program 3 times [2018-11-18 08:34:35,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,046 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-18 08:34:36,131 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:36,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:36,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:36,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:36,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:36,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:36,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:36,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:36,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 08:34:36,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:36,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:36,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:36,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:36,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:36,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,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-11-18 08:34:36,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:36,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:36,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:36,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:36,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:36,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:36,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:36,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:36,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:36,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:36,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:36,597 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:36,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:36,598 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:36,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:36,599 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:36,599 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:36,599 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4 Supporting invariants [] [2018-11-18 08:34:36,711 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:36,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:36,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:36,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:36,768 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 08:34:36,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-18 08:34:36,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 9 states. [2018-11-18 08:34:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-11-18 08:34:36,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 08:34:36,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 08:34:36,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 08:34:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:36,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-18 08:34:36,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:36,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 30 states and 34 transitions. [2018-11-18 08:34:36,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:34:36,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:34:36,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-11-18 08:34:36,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:36,800 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 08:34:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-11-18 08:34:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-18 08:34:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 08:34:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-18 08:34:36,805 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 08:34:36,805 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 08:34:36,805 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:36,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-18 08:34:36,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 08:34:36,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:36,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:36,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:36,807 INFO L794 eck$LassoCheckResult]: Stem: 1329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1324#L552-2 assume true; 1338#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1339#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1327#L551-4 main_#t~short9 := main_#t~short7; 1328#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1335#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1341#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1342#L552-2 assume true; 1336#L551-1 [2018-11-18 08:34:36,807 INFO L796 eck$LassoCheckResult]: Loop: 1336#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1337#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1325#L551-4 main_#t~short9 := main_#t~short7; 1326#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1334#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1330#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1331#L552-2 assume true; 1336#L551-1 [2018-11-18 08:34:36,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -410535110, now seen corresponding path program 2 times [2018-11-18 08:34:36,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 582240858, now seen corresponding path program 2 times [2018-11-18 08:34:36,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1573442303, now seen corresponding path program 3 times [2018-11-18 08:34:36,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:36,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:36,961 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-18 08:34:37,155 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2018-11-18 08:34:37,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:37,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:37,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:37,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:37,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:37,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:37,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:37,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:37,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-18 08:34:37,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:37,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,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-11-18 08:34:37,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,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-11-18 08:34:37,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:37,660 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:37,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:37,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:37,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:37,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:37,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:37,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:37,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:37,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:37,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,678 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:37,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,681 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:37,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:37,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:37,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:37,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:37,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:37,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:37,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:37,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:37,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:37,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:37,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:37,690 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:37,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:37,691 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:37,691 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:37,691 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5 Supporting invariants [] [2018-11-18 08:34:37,751 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:37,752 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:37,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:37,773 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 08:34:37,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:37,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:37,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:34:37,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 08:34:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:37,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:37,874 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-11-18 08:34:37,904 INFO L477 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-11-18 08:34:37,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:37,921 INFO L477 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 59 treesize of output 59 [2018-11-18 08:34:37,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-18 08:34:37,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:37,936 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:37,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:37,939 INFO L477 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-11-18 08:34:37,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:37,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-11-18 08:34:38,483 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-18 08:34:38,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-11-18 08:34:38,486 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:38,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:38,488 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:38,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:38,491 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:38,824 INFO L477 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 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-18 08:34:38,824 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 88 [2018-11-18 08:34:39,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2018-11-18 08:34:39,179 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-18 08:34:39,259 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-11-18 08:34:39,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,315 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:34:39,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,321 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 100 [2018-11-18 08:34:39,322 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,336 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-11-18 08:34:39,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,378 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:39,378 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,387 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,414 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 08:34:39,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,417 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:39,418 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,424 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,435 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-11-18 08:34:39,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,445 INFO L477 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 23 treesize of output 16 [2018-11-18 08:34:39,446 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:39,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,462 INFO L477 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-11-18 08:34:39,462 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,466 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,472 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,477 INFO L477 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 0 case distinctions, treesize of input 77 treesize of output 69 [2018-11-18 08:34:39,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-18 08:34:39,481 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,492 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:39,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,496 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:39,496 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,500 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,506 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,620 INFO L477 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 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-18 08:34:39,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-18 08:34:39,625 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,639 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:39,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,642 INFO L477 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-11-18 08:34:39,643 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,649 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,654 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:39,726 INFO L477 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 1 case distinctions, treesize of input 126 treesize of output 90 [2018-11-18 08:34:39,756 INFO L477 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-11-18 08:34:39,756 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-11-18 08:34:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-18 08:34:39,808 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,861 INFO L477 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 59 treesize of output 62 [2018-11-18 08:34:39,861 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-11-18 08:34:39,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:34:39,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,915 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-11-18 08:34:39,916 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,928 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,962 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-18 08:34:39,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:39,965 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:39,965 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,973 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:39,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-11-18 08:34:40,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,003 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:40,003 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,018 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,032 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-11-18 08:34:40,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,047 INFO L477 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-11-18 08:34:40,047 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:40,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,064 INFO L477 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-11-18 08:34:40,065 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,070 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,075 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,081 INFO L477 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 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-18 08:34:40,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 38 [2018-11-18 08:34:40,085 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,101 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:40,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,104 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:40,104 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,109 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,114 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,131 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:40,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:40,168 INFO L202 ElimStorePlain]: Needed 52 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-18 08:34:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:40,180 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-11-18 08:34:40,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 08:34:40,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 44 states and 50 transitions. Complement of second has 10 states. [2018-11-18 08:34:40,225 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-11-18 08:34:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-18 08:34:40,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 08:34:40,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:40,226 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:40,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,250 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 08:34:40,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:34:40,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 08:34:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:40,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:40,338 INFO L477 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 1 case distinctions, treesize of input 126 treesize of output 90 [2018-11-18 08:34:40,367 INFO L477 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-11-18 08:34:40,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-11-18 08:34:40,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,403 INFO L477 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-11-18 08:34:40,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:40,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,417 INFO L477 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-11-18 08:34:40,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,422 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,431 INFO L477 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 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-18 08:34:40,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 38 [2018-11-18 08:34:40,435 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,448 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:40,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,452 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:40,452 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,458 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-11-18 08:34:40,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-18 08:34:40,492 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,546 INFO L477 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 59 treesize of output 62 [2018-11-18 08:34:40,546 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 08:34:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,591 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:40,591 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,598 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 70 [2018-11-18 08:34:40,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:40,648 INFO L477 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 45 treesize of output 44 [2018-11-18 08:34:40,649 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 40 treesize of output 39 [2018-11-18 08:34:40,680 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,694 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:40,706 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:40,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:40,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-11-18 08:34:41,269 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-18 08:34:41,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:41,272 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-11-18 08:34:41,274 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:41,276 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,626 INFO L477 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 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-18 08:34:41,626 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:41,970 INFO L477 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 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-18 08:34:41,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:41,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-18 08:34:41,974 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:41,985 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:41,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:41,988 INFO L477 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-11-18 08:34:41,988 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,992 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:41,997 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:42,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,207 INFO L477 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 0 case distinctions, treesize of input 77 treesize of output 69 [2018-11-18 08:34:42,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-18 08:34:42,210 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:42,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,222 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:42,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,225 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:42,226 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:42,233 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:42,238 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:42,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,263 INFO L477 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2018-11-18 08:34:42,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:42,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2018-11-18 08:34:42,275 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:43,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:43,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-11-18 08:34:43,131 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:44,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-18 08:34:44,181 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:44,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-11-18 08:34:44,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,720 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:34:44,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:44,729 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-11-18 08:34:44,730 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:44,751 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,057 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 08:34:45,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,060 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:45,060 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,066 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,312 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 08:34:45,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,318 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:45,318 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,326 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,460 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 08:34:45,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,463 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:45,464 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,469 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,497 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-11-18 08:34:45,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,518 INFO L477 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 77 treesize of output 70 [2018-11-18 08:34:45,518 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-11-18 08:34:45,592 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-18 08:34:45,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,651 INFO L477 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-11-18 08:34:45,652 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,658 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,697 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-18 08:34:45,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,700 INFO L477 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-11-18 08:34:45,700 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,707 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,717 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,775 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:45,779 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-11-18 08:34:45,808 INFO L477 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-11-18 08:34:45,808 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,822 INFO L477 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 59 treesize of output 59 [2018-11-18 08:34:45,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-18 08:34:45,825 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,838 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:45,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,842 INFO L477 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-11-18 08:34:45,842 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,848 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,852 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,859 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:45,895 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-18 08:34:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:45,908 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-11-18 08:34:45,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 08:34:45,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 41 states and 45 transitions. Complement of second has 12 states. [2018-11-18 08:34:45,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-18 08:34:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 08:34:45,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:45,949 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:45,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:45,976 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 08:34:45,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:45,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:34:45,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:45,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 08:34:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:45,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:46,062 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-11-18 08:34:46,090 INFO L477 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-11-18 08:34:46,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,104 INFO L477 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 59 treesize of output 59 [2018-11-18 08:34:46,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-18 08:34:46,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,119 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:46,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,122 INFO L477 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-11-18 08:34:46,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,147 INFO L477 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 1 case distinctions, treesize of input 126 treesize of output 90 [2018-11-18 08:34:46,178 INFO L477 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-11-18 08:34:46,178 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-11-18 08:34:46,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,217 INFO L477 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-11-18 08:34:46,218 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:46,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,231 INFO L477 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-11-18 08:34:46,232 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,236 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,240 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-11-18 08:34:46,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,264 INFO L477 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 77 treesize of output 70 [2018-11-18 08:34:46,264 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-11-18 08:34:46,320 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,363 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-18 08:34:46,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,366 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:46,366 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,372 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-11-18 08:34:46,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:34:46,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,427 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-11-18 08:34:46,427 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,443 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-11-18 08:34:46,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,558 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:46,559 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,582 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,594 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,600 INFO L477 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 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-18 08:34:46,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 38 [2018-11-18 08:34:46,604 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,617 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:46,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:46,622 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:46,623 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,628 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,637 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:46,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:46,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-11-18 08:34:47,350 WARN L180 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-18 08:34:47,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:47,353 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:47,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 86 treesize of output 85 [2018-11-18 08:34:47,355 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:47,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 84 treesize of output 83 [2018-11-18 08:34:47,357 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:47,768 INFO L477 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 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-18 08:34:47,768 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,117 INFO L477 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 0 case distinctions, treesize of input 77 treesize of output 69 [2018-11-18 08:34:48,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-18 08:34:48,121 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,133 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:48,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,136 INFO L477 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 35 treesize of output 24 [2018-11-18 08:34:48,136 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,141 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,146 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 88 [2018-11-18 08:34:48,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-11-18 08:34:48,168 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-11-18 08:34:48,231 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-11-18 08:34:48,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,285 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:48,285 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,293 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,322 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 08:34:48,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,325 INFO L477 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 33 treesize of output 22 [2018-11-18 08:34:48,325 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,332 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,351 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-11-18 08:34:48,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,361 INFO L477 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 23 treesize of output 16 [2018-11-18 08:34:48,361 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-18 08:34:48,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,376 INFO L477 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-11-18 08:34:48,377 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,381 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,387 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-11-18 08:34:48,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-11-18 08:34:48,517 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2018-11-18 08:34:48,576 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2018-11-18 08:34:48,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,637 INFO L477 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-11-18 08:34:48,637 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,648 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,694 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-11-18 08:34:48,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:48,696 INFO L477 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-11-18 08:34:48,697 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,703 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:48,717 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:48,766 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:48,804 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-18 08:34:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:48,817 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-11-18 08:34:48,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 08:34:48,853 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 53 states and 60 transitions. Complement of second has 11 states. [2018-11-18 08:34:48,855 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-11-18 08:34:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 08:34:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-18 08:34:48,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 08:34:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-18 08:34:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-18 08:34:48,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:48,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2018-11-18 08:34:48,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 08:34:48,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 28 states and 32 transitions. [2018-11-18 08:34:48,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-18 08:34:48,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-18 08:34:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2018-11-18 08:34:48,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:48,858 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 08:34:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2018-11-18 08:34:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-11-18 08:34:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 08:34:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-18 08:34:48,860 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 08:34:48,860 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 08:34:48,860 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:34:48,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-18 08:34:48,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-18 08:34:48,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:48,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:48,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:48,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-18 08:34:48,862 INFO L794 eck$LassoCheckResult]: Stem: 1812#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1810#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~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_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1811#L552-2 assume true; 1818#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1827#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1826#L551-4 main_#t~short9 := main_#t~short7; 1825#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1824#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1823#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1822#L552-2 assume true; 1820#L551-1 [2018-11-18 08:34:48,862 INFO L796 eck$LassoCheckResult]: Loop: 1820#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1821#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1813#L551-4 main_#t~short9 := main_#t~short7; 1814#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1817#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1815#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1816#L552-2 assume true; 1818#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1827#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1826#L551-4 main_#t~short9 := main_#t~short7; 1825#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1824#L551-7 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5; 1823#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1822#L552-2 assume true; 1820#L551-1 [2018-11-18 08:34:48,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -410535110, now seen corresponding path program 3 times [2018-11-18 08:34:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2118035037, now seen corresponding path program 1 times [2018-11-18 08:34:48,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2038463772, now seen corresponding path program 4 times [2018-11-18 08:34:48,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:48,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:49,253 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-11-18 08:34:49,475 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2018-11-18 08:34:49,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:49,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:49,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:49,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:49,523 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:49,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:49,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:49,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 08:34:49,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:49,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:49,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:49,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:49,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:49,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:49,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:49,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:49,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:49,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:49,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:50,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:50,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:50,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:50,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:50,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:50,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:50,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:50,034 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:50,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:50,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:50,035 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:50,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-18 08:34:50,110 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 08:34:50,113 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:50,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:50,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:50,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,145 INFO L477 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-11-18 08:34:50,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,162 INFO L477 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-11-18 08:34:50,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 08:34:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:50,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:50,277 INFO L477 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 122 treesize of output 86 [2018-11-18 08:34:50,304 INFO L477 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-11-18 08:34:50,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2018-11-18 08:34:50,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,342 INFO L477 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-11-18 08:34:50,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 69 [2018-11-18 08:34:50,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,380 INFO L477 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 58 treesize of output 51 [2018-11-18 08:34:50,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 37 treesize of output 54 [2018-11-18 08:34:50,428 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-18 08:34:50,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:50,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:50,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:50,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:34:50,502 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2018-11-18 08:34:50,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-18 08:34:50,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:50,531 INFO L477 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-11-18 08:34:50,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,539 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 08:34:50,540 INFO L477 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-11-18 08:34:50,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:50,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-11-18 08:34:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:50,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 08:34:50,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 08:34:50,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 69 states and 80 transitions. Complement of second has 11 states. [2018-11-18 08:34:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 08:34:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-11-18 08:34:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-18 08:34:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 24 letters. Loop has 14 letters. [2018-11-18 08:34:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 10 letters. Loop has 28 letters. [2018-11-18 08:34:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:50,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 80 transitions. [2018-11-18 08:34:50,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:50,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:50,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:50,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:50,616 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:34:50,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:50,616 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:50,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:50,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:50 BoogieIcfgContainer [2018-11-18 08:34:50,622 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:50,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:50,623 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:50,623 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:50,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30" (3/4) ... [2018-11-18 08:34:50,626 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:50,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:50,627 INFO L168 Benchmark]: Toolchain (without parser) took 20682.33 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.9 MB). Free memory was 955.4 MB in the beginning and 1.4 GB in the end (delta: -451.3 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,627 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:50,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -195.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,627 INFO L168 Benchmark]: Boogie Preprocessor took 17.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,628 INFO L168 Benchmark]: RCFGBuilder took 174.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,628 INFO L168 Benchmark]: BuchiAutomizer took 20115.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -279.6 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:50,628 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:50,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -195.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 174.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20115.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -279.6 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 - 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 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 0.2s. Büchi inclusion checks took 12.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/7 HoareTripleCheckerStatistics: 86 SDtfs, 136 SDslu, 75 SDs, 0 SdLazy, 191 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital933 mio100 ax104 hnf100 lsp93 ukn41 mio100 lsp41 div100 bol100 ite100 ukn100 eq188 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...