./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/gcd1-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_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/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 160024a3cc4acfbc7213f984e87ef0c708b94aaf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:15:39,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:15:39,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:15:39,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:15:39,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:15:39,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:15:39,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:15:39,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:15:39,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:15:39,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:15:39,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:15:39,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:15:39,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:15:39,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:15:39,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:15:39,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:15:39,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:15:39,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:15:39,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:15:39,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:15:39,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:15:39,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:15:39,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:15:39,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:15:39,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:15:39,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:15:39,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:15:39,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:15:39,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:15:39,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:15:39,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:15:39,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:15:39,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:15:39,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:15:39,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:15:39,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:15:39,851 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:15:39,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:15:39,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:15:39,866 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:15:39,867 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:15:39,867 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:15:39,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:15:39,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:15:39,869 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:15:39,869 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:15:39,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:15:39,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:15:39,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:15:39,872 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:15:39,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:15:39,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:15:39,872 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:15:39,873 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:15:39,873 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_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/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 -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2018-11-18 13:15:39,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:15:39,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:15:39,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:15:39,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:15:39,926 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:15:39,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-18 13:15:39,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/data/b37bf5c41/7c502b44a2e44619a14a0f9dc0988d56/FLAGf81f9cabe [2018-11-18 13:15:40,370 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:15:40,371 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-11-18 13:15:40,383 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/data/b37bf5c41/7c502b44a2e44619a14a0f9dc0988d56/FLAGf81f9cabe [2018-11-18 13:15:40,741 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/data/b37bf5c41/7c502b44a2e44619a14a0f9dc0988d56 [2018-11-18 13:15:40,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:15:40,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:15:40,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:15:40,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:15:40,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:15:40,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:15:40" (1/1) ... [2018-11-18 13:15:40,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37764a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:40, skipping insertion in model container [2018-11-18 13:15:40,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:15:40" (1/1) ... [2018-11-18 13:15:40,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:15:40,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:15:41,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:15:41,042 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:15:41,075 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:15:41,122 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:15:41,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41 WrapperNode [2018-11-18 13:15:41,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:15:41,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:15:41,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:15:41,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:15:41,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:15:41,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:15:41,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:15:41,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:15:41,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... [2018-11-18 13:15:41,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:15:41,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:15:41,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:15:41,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:15:41,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/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 13:15:41,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:15:41,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:15:41,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:15:41,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:15:41,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:15:41,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:15:41,510 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:15:41,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:41 BoogieIcfgContainer [2018-11-18 13:15:41,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:15:41,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:15:41,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:15:41,514 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:15:41,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:15:41,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:15:40" (1/3) ... [2018-11-18 13:15:41,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6380e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:15:41, skipping insertion in model container [2018-11-18 13:15:41,516 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:15:41,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:41" (2/3) ... [2018-11-18 13:15:41,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6380e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:15:41, skipping insertion in model container [2018-11-18 13:15:41,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:15:41,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:41" (3/3) ... [2018-11-18 13:15:41,522 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2018-11-18 13:15:41,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:15:41,561 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:15:41,561 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:15:41,561 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:15:41,561 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:15:41,561 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:15:41,562 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:15:41,562 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:15:41,562 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:15:41,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 13:15:41,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:41,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:41,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:41,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:41,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:41,601 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:15:41,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 13:15:41,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:41,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:41,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:41,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:41,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:41,610 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 10#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 16#L553-2true call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 6#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 13#L555-3true [2018-11-18 13:15:41,610 INFO L796 eck$LassoCheckResult]: Loop: 13#L555-3true assume true; 4#L555true call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 7#L555-1true assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 11#L557-4true assume !true; 14#L557-5true call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 13#L555-3true [2018-11-18 13:15:41,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-18 13:15:41,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:41,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:41,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 45873592, now seen corresponding path program 1 times [2018-11-18 13:15:41,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:41,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:41,798 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 13:15:41,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:41,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:15:41,802 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:15:41,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:15:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:15:41,813 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-18 13:15:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:41,817 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-18 13:15:41,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:15:41,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-18 13:15:41,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:41,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions. [2018-11-18 13:15:41,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 13:15:41,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 13:15:41,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-18 13:15:41,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:15:41,826 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 13:15:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-18 13:15:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 13:15:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:15:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 13:15:41,848 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 13:15:41,848 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 13:15:41,848 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:15:41,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 13:15:41,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:41,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:41,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:41,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:41,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:41,850 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 43#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 46#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 51#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 49#L555-3 [2018-11-18 13:15:41,850 INFO L796 eck$LassoCheckResult]: Loop: 49#L555-3 assume true; 50#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 53#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 44#L557-4 assume true; 45#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 52#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 48#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 49#L555-3 [2018-11-18 13:15:41,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2018-11-18 13:15:41,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:41,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1134573278, now seen corresponding path program 1 times [2018-11-18 13:15:41,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:41,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:41,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2033850090, now seen corresponding path program 1 times [2018-11-18 13:15:41,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:41,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:41,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:41,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:42,571 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-11-18 13:15:42,800 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-18 13:15:42,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:15:42,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:15:42,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:15:42,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:15:42,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:15:42,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:15:42,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:15:42,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:15:42,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 13:15:42,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:15:42,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:15:42,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 13:15:42,849 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 13:15:42,851 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 13:15:42,854 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 13:15:42,856 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 13:15:42,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,895 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 13:15:42,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,898 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 13:15:42,899 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 13:15:42,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,902 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 13:15:42,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,906 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 13:15:42,908 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 13:15:42,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:42,920 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 13:15:42,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:43,316 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-11-18 13:15:43,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 13:15:43,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:43,417 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 13:15:43,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:15:43,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:15:43,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:43,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:43,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:43,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:43,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:43,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:43,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:43,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:43,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:43,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:43,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:43,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:43,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:44,006 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:15:44,022 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:15:44,023 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:15:44,024 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:15:44,025 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:15:44,026 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:15:44,026 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-18 13:15:44,285 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 13:15:44,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:44,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:44,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:44,353 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 13:15:44,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:44,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:44,382 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 13:15:44,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:44,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:44,402 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 13:15:44,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:44,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:44,507 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-11-18 13:15:44,517 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 35 treesize of output 34 [2018-11-18 13:15:44,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:44,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-11-18 13:15:44,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:44,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:44,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:44,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-11-18 13:15:44,665 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 13:15:44,667 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 13:15:44,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 13:15:44,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 41 states and 48 transitions. Complement of second has 14 states. [2018-11-18 13:15:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:15:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-18 13:15:44,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-18 13:15:44,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:44,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-18 13:15:44,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:44,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-18 13:15:44,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:44,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-11-18 13:15:44,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 13:15:44,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 43 transitions. [2018-11-18 13:15:44,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 13:15:44,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-18 13:15:44,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-18 13:15:44,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:15:44,790 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-18 13:15:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-18 13:15:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-11-18 13:15:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 13:15:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-18 13:15:44,792 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 13:15:44,792 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 13:15:44,792 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:15:44,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-18 13:15:44,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:44,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:44,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:44,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:15:44,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:44,793 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 271#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 276#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 285#L554 assume gcd_#t~mem7 < 0;havoc gcd_#t~mem7;call gcd_#t~mem8 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(-gcd_#t~mem8, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem8; 279#L555-3 [2018-11-18 13:15:44,793 INFO L796 eck$LassoCheckResult]: Loop: 279#L555-3 assume true; 282#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 289#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 272#L557-4 assume true; 273#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 292#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 278#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 279#L555-3 [2018-11-18 13:15:44,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-11-18 13:15:44,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:44,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1134573278, now seen corresponding path program 2 times [2018-11-18 13:15:44,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:44,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:44,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:44,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1224503464, now seen corresponding path program 1 times [2018-11-18 13:15:44,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:45,130 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-11-18 13:15:45,190 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:15:45,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:15:45,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:15:45,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:15:45,190 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:15:45,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:15:45,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:15:45,191 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:15:45,191 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 13:15:45,191 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:15:45,191 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:15:45,194 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 13:15:45,198 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 13:15:45,199 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 13:15:45,200 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 13:15:45,201 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 13:15:45,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 13:15:45,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 13:15:45,205 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 13:15:45,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 13:15:45,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 13:15:45,209 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 13:15:45,210 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 13:15:45,212 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 13:15:45,213 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 13:15:45,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:45,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:45,232 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 13:15:45,413 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-11-18 13:15:45,483 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 13:15:45,484 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 13:15:45,486 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 13:15:45,487 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 13:15:45,492 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 13:15:45,493 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 13:15:45,494 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 13:15:46,027 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:15:46,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:15:46,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,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 13:15:46,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:46,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:46,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:46,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,067 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:46,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,073 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:46,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:46,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:46,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:46,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:46,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,162 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:46,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,163 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:46,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:46,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,168 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:46,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,169 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:46,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:46,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:46,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:46,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:46,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:46,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:46,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:46,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:46,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:15:46,200 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:15:46,200 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 13:15:46,201 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:15:46,201 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:15:46,202 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:15:46,202 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-18 13:15:46,471 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 13:15:46,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:46,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:46,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:46,503 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 13:15:46,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:46,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:46,511 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 13:15:46,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:46,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:46,519 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 13:15:46,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:46,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:46,640 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-11-18 13:15:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2018-11-18 13:15:46,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:46,704 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 27 treesize of output 26 [2018-11-18 13:15:46,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:46,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:46,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:46,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-11-18 13:15:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:46,809 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 13:15:46,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-18 13:15:46,892 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 54 states and 63 transitions. Complement of second has 14 states. [2018-11-18 13:15:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:15:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-18 13:15:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-18 13:15:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-18 13:15:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-18 13:15:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:46,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 63 transitions. [2018-11-18 13:15:46,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 13:15:46,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 49 states and 58 transitions. [2018-11-18 13:15:46,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 13:15:46,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 13:15:46,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2018-11-18 13:15:46,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:15:46,895 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-18 13:15:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2018-11-18 13:15:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 25. [2018-11-18 13:15:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 13:15:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-18 13:15:46,896 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 13:15:46,896 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 13:15:46,896 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:15:46,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-18 13:15:46,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:46,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:46,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:46,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:46,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:15:46,897 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 525#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 530#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 539#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 545#L555-3 assume true; 538#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 548#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 526#L557-4 assume true; 527#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 540#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 544#L557-4 [2018-11-18 13:15:46,898 INFO L796 eck$LassoCheckResult]: Loop: 544#L557-4 assume true; 547#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 546#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 544#L557-4 [2018-11-18 13:15:46,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1451081388, now seen corresponding path program 1 times [2018-11-18 13:15:46,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:46,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:46,917 INFO L82 PathProgramCache]: Analyzing trace with hash 58657, now seen corresponding path program 1 times [2018-11-18 13:15:46,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:46,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:46,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -319766802, now seen corresponding path program 2 times [2018-11-18 13:15:46,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:47,360 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2018-11-18 13:15:47,460 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:15:47,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:15:47,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:15:47,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:15:47,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:15:47,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:15:47,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:15:47,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:15:47,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 13:15:47,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:15:47,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:15:47,464 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 13:15:47,466 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 13:15:47,467 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 13:15:47,468 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 13:15:47,470 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 13:15:47,471 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 13:15:47,472 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 13:15:47,474 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 13:15:47,475 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 13:15:47,476 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 13:15:47,477 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 13:15:47,478 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 13:15:47,479 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 13:15:47,486 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 13:15:47,490 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 13:15:47,491 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 13:15:47,495 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 13:15:47,496 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 13:15:47,497 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 13:15:47,501 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 13:15:47,505 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 13:15:47,509 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 13:15:47,511 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 13:15:47,674 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-11-18 13:15:47,719 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 13:15:47,977 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:15:47,977 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:15:47,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:47,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:47,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,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 13:15:47,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:47,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:47,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,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 13:15:47,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,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 13:15:47,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:47,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:47,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:47,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:47,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:47,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:47,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:47,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:47,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:47,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:47,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,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 13:15:48,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,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 13:15:48,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,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 13:15:48,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:48,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:48,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:48,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,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 13:15:48,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,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 13:15:48,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,049 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:48,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,050 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:48,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,059 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:48,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,060 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:48,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:48,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:48,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:48,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:48,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:48,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:48,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:48,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:48,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:15:48,101 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:15:48,101 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:15:48,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:15:48,102 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 13:15:48,102 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:15:48,102 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2018-11-18 13:15:48,309 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2018-11-18 13:15:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:48,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:48,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:48,545 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 13:15:48,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:48,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:48,561 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 13:15:48,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:15:48,585 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 13:15:48,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 13:15:48,608 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 20 treesize of output 19 [2018-11-18 13:15:48,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-11-18 13:15:48,632 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:48,642 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:48,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:48,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:48,679 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2018-11-18 13:15:48,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:48,738 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 49 [2018-11-18 13:15:48,761 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 35 treesize of output 34 [2018-11-18 13:15:48,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,810 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 20 treesize of output 19 [2018-11-18 13:15:48,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:48,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:15:48,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-11-18 13:15:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:48,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:48,883 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 13:15:48,883 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-18 13:15:48,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-18 13:15:48,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 33 states and 40 transitions. Complement of second has 10 states. [2018-11-18 13:15:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:15:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-18 13:15:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 13:15:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 13:15:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 13:15:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:48,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2018-11-18 13:15:48,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:48,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 39 transitions. [2018-11-18 13:15:48,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 13:15:48,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 13:15:48,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-18 13:15:48,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:15:48,963 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-18 13:15:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-18 13:15:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-18 13:15:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 13:15:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-18 13:15:48,967 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 13:15:48,967 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 13:15:48,967 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:15:48,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-18 13:15:48,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 13:15:48,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:48,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:48,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:48,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:48,968 INFO L794 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 746#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 752#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 761#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 769#L555-3 assume true; 760#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 765#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 775#L557-4 assume true; 774#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 773#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 772#L557-4 assume true; 751#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 764#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 754#L557-5 [2018-11-18 13:15:48,969 INFO L796 eck$LassoCheckResult]: Loop: 754#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 755#L555-3 assume true; 758#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 767#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 747#L557-4 assume true; 748#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 762#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 754#L557-5 [2018-11-18 13:15:48,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -319766804, now seen corresponding path program 1 times [2018-11-18 13:15:48,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:48,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:48,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash -877179312, now seen corresponding path program 3 times [2018-11-18 13:15:49,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:49,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:49,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash -339148539, now seen corresponding path program 1 times [2018-11-18 13:15:49,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:49,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:49,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:49,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:49,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:15:49,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:15:49,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e66d5619-5bfc-4cb9-9a91-8e392b8d7b2c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:15:49,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:49,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:49,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:49,485 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 13:15:49,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:49,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:49,523 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 13:15:49,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-18 13:15:49,591 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 23 treesize of output 23 [2018-11-18 13:15:49,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 13:15:49,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-11-18 13:15:49,662 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 0 case distinctions, treesize of input 53 treesize of output 53 [2018-11-18 13:15:49,666 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 12 treesize of output 11 [2018-11-18 13:15:49,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:49,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-18 13:15:49,683 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 43 treesize of output 37 [2018-11-18 13:15:49,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,692 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 13:15:49,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:77, output treesize:37 [2018-11-18 13:15:49,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:49,731 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-18 13:15:49,734 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 43 treesize of output 37 [2018-11-18 13:15:49,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:15:49,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2018-11-18 13:15:49,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-11-18 13:15:49,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 13:15:49,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:15:49,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 13:15:49,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:49,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-11-18 13:15:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:15:49,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:15:49,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-18 13:15:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 13:15:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:49,972 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-11-18 13:15:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:50,332 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 13:15:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:50,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-18 13:15:50,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:15:50,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 54 transitions. [2018-11-18 13:15:50,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 13:15:50,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 13:15:50,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2018-11-18 13:15:50,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:15:50,335 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 13:15:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2018-11-18 13:15:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-11-18 13:15:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 13:15:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-18 13:15:50,339 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-18 13:15:50,339 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-18 13:15:50,339 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:15:50,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2018-11-18 13:15:50,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:15:50,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:50,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:50,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:50,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:50,341 INFO L794 eck$LassoCheckResult]: Stem: 929#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 921#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 922#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 928#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 934#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 942#L555-3 assume true; 948#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 947#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 946#L557-4 assume true; 945#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 944#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 943#L557-4 assume true; 927#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 935#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 949#L557-5 [2018-11-18 13:15:50,341 INFO L796 eck$LassoCheckResult]: Loop: 949#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 932#L555-3 assume true; 933#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 940#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 941#L557-4 assume true; 954#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 939#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 923#L557-4 assume true; 924#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 953#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 949#L557-5 [2018-11-18 13:15:50,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -319766804, now seen corresponding path program 2 times [2018-11-18 13:15:50,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1467766482, now seen corresponding path program 1 times [2018-11-18 13:15:50,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1810956711, now seen corresponding path program 2 times [2018-11-18 13:15:50,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:50,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:50,917 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-11-18 13:15:51,284 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2018-11-18 13:15:51,360 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:15:51,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:15:51,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:15:51,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:15:51,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:15:51,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:15:51,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:15:51,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:15:51,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-18 13:15:51,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:15:51,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:15:51,364 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 13:15:51,368 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 13:15:51,369 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 13:15:51,370 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 13:15:51,371 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 13:15:51,372 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 13:15:51,374 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 13:15:51,375 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 13:15:51,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,384 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 13:15:51,386 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 13:15:51,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:51,392 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 13:15:51,393 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 13:15:51,657 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-11-18 13:15:51,725 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 13:15:51,726 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 13:15:52,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:15:52,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:15:52,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,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 13:15:52,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,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 13:15:52,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:52,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:52,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:52,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:52,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:52,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:52,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,139 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:52,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,139 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:52,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,144 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:15:52,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:15:52,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:52,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:52,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:52,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:52,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:52,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:52,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:52,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:52,170 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:15:52,185 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 13:15:52,188 INFO L444 ModelExtractionUtils]: 22 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 13:15:52,189 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:15:52,189 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:15:52,189 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:15:52,189 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_4 Supporting invariants [] [2018-11-18 13:15:52,429 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 13:15:52,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:52,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:52,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:52,465 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 13:15:52,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:52,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:52,474 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 13:15:52,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:52,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:52,480 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 13:15:52,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:52,537 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 47 treesize of output 54 [2018-11-18 13:15:52,553 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 43 treesize of output 42 [2018-11-18 13:15:52,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:52,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-18 13:15:52,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:52,667 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 6 case distinctions, treesize of input 37 treesize of output 62 [2018-11-18 13:15:52,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-11-18 13:15:52,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:52,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-11-18 13:15:52,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:52,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2018-11-18 13:15:52,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-18 13:15:52,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 13:15:53,011 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 6 case distinctions, treesize of input 34 treesize of output 61 [2018-11-18 13:15:53,015 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 13:15:53,015 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-18 13:15:53,081 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2018-11-18 13:15:53,130 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 13:15:53,167 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:53,186 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:53,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:53,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:53,241 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:63, output treesize:95 [2018-11-18 13:15:53,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-11-18 13:15:53,307 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 30 treesize of output 37 [2018-11-18 13:15:53,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,376 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 57 [2018-11-18 13:15:53,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 67 [2018-11-18 13:15:53,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:53,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:53,487 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 1 case distinctions, treesize of input 49 treesize of output 42 [2018-11-18 13:15:53,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-18 13:15:53,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,498 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 13:15:53,610 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:161, output treesize:191 [2018-11-18 13:15:53,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:53,678 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 4 case distinctions, treesize of input 49 treesize of output 71 [2018-11-18 13:15:53,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:53,684 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 58 treesize of output 70 [2018-11-18 13:15:53,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:53,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:53,719 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 39 treesize of output 64 [2018-11-18 13:15:53,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 13:15:53,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:53,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 13:15:53,768 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:118 [2018-11-18 13:15:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:53,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-18 13:15:53,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-18 13:15:54,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 80 states and 90 transitions. Complement of second has 14 states. [2018-11-18 13:15:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:15:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-18 13:15:54,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 13:15:54,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:54,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-18 13:15:54,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:54,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 20 letters. [2018-11-18 13:15:54,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:54,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 90 transitions. [2018-11-18 13:15:54,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:15:54,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 76 states and 86 transitions. [2018-11-18 13:15:54,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-18 13:15:54,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-18 13:15:54,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 86 transitions. [2018-11-18 13:15:54,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:15:54,180 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-11-18 13:15:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 86 transitions. [2018-11-18 13:15:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2018-11-18 13:15:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 13:15:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-18 13:15:54,184 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-18 13:15:54,184 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-18 13:15:54,184 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:15:54,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2018-11-18 13:15:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:15:54,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:15:54,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:15:54,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:54,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:54,185 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 1249#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1254#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1264#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1274#L555-3 assume true; 1298#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1297#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1296#L557-4 assume true; 1295#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1294#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1293#L557-4 assume true; 1283#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1279#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 1280#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 1260#L555-3 assume true; 1308#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1305#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1306#L557-4 assume true; 1301#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1302#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1273#L557-4 [2018-11-18 13:15:54,185 INFO L796 eck$LassoCheckResult]: Loop: 1273#L557-4 assume true; 1265#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1266#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 1284#L557-4 assume true; 1281#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1282#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 1256#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 1257#L555-3 assume true; 1307#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1272#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 1273#L557-4 [2018-11-18 13:15:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -339148537, now seen corresponding path program 3 times [2018-11-18 13:15:54,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash 102156654, now seen corresponding path program 2 times [2018-11-18 13:15:54,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:54,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:54,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:54,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -324093196, now seen corresponding path program 4 times [2018-11-18 13:15:54,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:15:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:15:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:15:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:54,502 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-18 13:15:55,358 WARN L180 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 151 [2018-11-18 13:15:55,556 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 13:15:55,559 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:15:55,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:15:55,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:15:55,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:15:55,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:15:55,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:15:55,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:15:55,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:15:55,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 13:15:55,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:15:55,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:15:55,563 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 13:15:55,565 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 13:15:55,567 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 13:15:55,568 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 13:15:55,570 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 13:15:55,571 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 13:15:55,573 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 13:15:55,574 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 13:15:55,575 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 13:15:55,577 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 13:15:55,578 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 13:15:55,579 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 13:15:55,581 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 13:15:55,582 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 13:15:56,156 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-18 13:15:56,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:15:56,228 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 13:15:56,230 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 13:15:56,232 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 13:15:56,234 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 13:15:56,235 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 13:15:56,237 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 13:15:56,238 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 13:15:56,239 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 13:15:56,241 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 13:15:56,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:15:56,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:15:56,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:56,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:56,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:56,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:56,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:15:56,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:15:56,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:15:56,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:15:56,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:15:56,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:15:56,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:15:56,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:15:56,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:15:56,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:15:56,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:15:56,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:15:56,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:15:56,581 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:15:56,581 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 13:15:56,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:15:56,582 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:15:56,583 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:15:56,583 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_5 Supporting invariants [] [2018-11-18 13:15:56,788 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 13:15:56,789 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:15:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:56,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:56,826 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 13:15:56,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:56,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:56,835 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 13:15:56,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:56,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:56,842 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 13:15:56,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:56,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:56,872 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 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 13:15:56,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 13:15:56,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 13:15:56,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-18 13:15:56,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:56,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:56,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:56,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-18 13:15:57,078 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 60 treesize of output 63 [2018-11-18 13:15:57,091 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 56 treesize of output 55 [2018-11-18 13:15:57,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:57,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-11-18 13:15:57,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:57,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,181 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 51 treesize of output 67 [2018-11-18 13:15:57,186 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 60 treesize of output 56 [2018-11-18 13:15:57,186 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:57,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,212 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-11-18 13:15:57,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:57,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:57,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,288 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 6 case distinctions, treesize of input 50 treesize of output 88 [2018-11-18 13:15:57,301 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 57 [2018-11-18 13:15:57,302 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 43 treesize of output 50 [2018-11-18 13:15:57,471 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:57,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:57,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2018-11-18 13:15:57,605 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:57,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 13:15:57,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:57,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:57,769 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-18 13:15:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:57,841 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-18 13:15:57,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-18 13:15:57,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 155 states and 176 transitions. Complement of second has 16 states. [2018-11-18 13:15:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 13:15:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-18 13:15:57,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-18 13:15:57,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:57,969 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:15:57,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:57,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:58,005 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 13:15:58,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,026 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 13:15:58,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,032 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 13:15:58,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:58,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:58,053 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 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 13:15:58,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-18 13:15:58,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 13:15:58,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 13:15:58,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:58,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:58,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-18 13:15:58,230 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 60 treesize of output 63 [2018-11-18 13:15:58,234 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 56 treesize of output 55 [2018-11-18 13:15:58,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-11-18 13:15:58,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,323 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 51 treesize of output 67 [2018-11-18 13:15:58,326 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 60 treesize of output 56 [2018-11-18 13:15:58,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-11-18 13:15:58,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:15:58,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 88 [2018-11-18 13:15:58,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 74 treesize of output 66 [2018-11-18 13:15:58,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:58,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2018-11-18 13:15:58,578 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:58,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:58,712 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-11-18 13:15:58,713 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 13:15:58,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 13:15:58,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:58,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:58,848 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-18 13:15:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:58,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-18 13:15:58,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-18 13:15:59,055 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 155 states and 176 transitions. Complement of second has 16 states. [2018-11-18 13:15:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 13:15:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 13:15:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-18 13:15:59,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-18 13:15:59,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:15:59,062 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:15:59,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:59,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:59,116 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 13:15:59,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,126 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 13:15:59,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,133 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 13:15:59,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 13:15:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:59,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:15:59,181 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 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 13:15:59,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 13:15:59,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 13:15:59,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-18 13:15:59,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:59,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:15:59,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-11-18 13:15:59,466 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 60 treesize of output 63 [2018-11-18 13:15:59,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-11-18 13:15:59,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,517 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 52 treesize of output 51 [2018-11-18 13:15:59,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,657 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 6 case distinctions, treesize of input 50 treesize of output 88 [2018-11-18 13:15:59,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 74 treesize of output 66 [2018-11-18 13:15:59,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:15:59,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:15:59,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2018-11-18 13:15:59,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:00,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:00,044 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-11-18 13:16:00,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:00,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 13:16:00,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:00,978 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-11-18 13:16:01,006 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 60 treesize of output 56 [2018-11-18 13:16:01,006 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:01,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:01,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:01,258 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-11-18 13:16:01,258 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:01,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:01,309 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-11-18 13:16:01,310 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:01,358 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:16:01,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:16:01,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:16:01,431 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-11-18 13:16:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:16:01,519 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 6 loop predicates [2018-11-18 13:16:01,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-18 13:16:01,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 153 states and 174 transitions. Complement of second has 20 states. [2018-11-18 13:16:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 13:16:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 13:16:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2018-11-18 13:16:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-18 13:16:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:16:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 31 letters. Loop has 10 letters. [2018-11-18 13:16:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:16:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 21 letters. Loop has 20 letters. [2018-11-18 13:16:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:16:01,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 174 transitions. [2018-11-18 13:16:01,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:16:01,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 99 states and 114 transitions. [2018-11-18 13:16:01,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 13:16:01,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 13:16:01,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 114 transitions. [2018-11-18 13:16:01,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:16:01,649 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-11-18 13:16:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 114 transitions. [2018-11-18 13:16:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2018-11-18 13:16:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 13:16:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-11-18 13:16:01,654 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-11-18 13:16:01,654 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-11-18 13:16:01,654 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:16:01,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 97 transitions. [2018-11-18 13:16:01,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:16:01,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:16:01,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:16:01,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:16:01,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:16:01,657 INFO L794 eck$LassoCheckResult]: Stem: 2264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;assume { :begin_inline_gcd } true;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.alloc(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.alloc(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.alloc(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 2258#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 2259#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2273#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 2281#L555-3 assume true; 2294#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2295#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 2293#L557-4 assume true; 2291#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2288#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 2287#L557-4 assume true; 2275#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2276#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 2308#L557-4 assume true; 2306#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2305#L557-2 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11; 2271#L557-5 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 2267#L555-3 assume true; 2268#L555 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2278#L555-1 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 2284#L557-4 assume true; 2261#L557-1 [2018-11-18 13:16:01,657 INFO L796 eck$LassoCheckResult]: Loop: 2261#L557-1 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2274#L557-2 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem12;havoc gcd_#t~mem11;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem14;havoc gcd_#t~mem13; 2260#L557-4 assume true; 2261#L557-1 [2018-11-18 13:16:01,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:16:01,657 INFO L82 PathProgramCache]: Analyzing trace with hash 127279420, now seen corresponding path program 5 times [2018-11-18 13:16:01,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:16:01,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:16:01,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:16:01,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:16:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 60727, now seen corresponding path program 2 times [2018-11-18 13:16:01,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:16:01,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:16:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:16:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:16:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash -674890212, now seen corresponding path program 6 times [2018-11-18 13:16:01,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:16:01,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:16:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:16:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:16:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:16:01,985 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 13:16:03,020 WARN L180 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 154 [2018-11-18 13:16:03,287 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-18 13:16:03,290 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:16:03,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:16:03,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:16:03,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:16:03,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:16:03,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:16:03,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:16:03,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:16:03,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-18 13:16:03,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:16:03,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:16:03,293 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 13:16:03,295 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 13:16:03,296 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 13:16:03,297 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 13:16:03,298 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 13:16:03,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,568 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-18 13:16:03,619 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 13:16:03,620 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 13:16:03,623 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 13:16:03,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,626 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 13:16:03,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,630 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 13:16:03,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:16:03,632 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 13:16:03,634 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 13:16:03,637 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 13:16:03,640 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 13:16:03,645 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 13:16:03,646 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 13:16:03,648 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 13:16:03,650 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 13:16:03,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:16:03,907 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:16:03,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:16:03,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:16:03,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:16:03,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:16:03,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:16:03,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:16:03,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:16:03,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:16:03,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:16:03,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:16:03,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:16:03,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:16:03,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,923 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:16:03,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,923 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:16:03,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,945 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:16:03,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:16:03,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:16:03,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 13:16:03,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:16:03,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:16:03,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:16:03,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:16:03,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:16:03,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:16:03,981 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:16:03,987 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:16:03,987 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:16:03,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:16:03,988 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 13:16:03,988 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:16:03,988 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_6, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_6 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6 - 1 >= 0] [2018-11-18 13:16:04,099 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 13:16:04,106 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:16:04,106 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:16:04,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:16:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:16:04,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:16:04,197 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 13:16:04,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,294 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 13:16:04,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,315 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 13:16:04,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 13:16:04,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,398 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 13:16:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-11-18 13:16:04,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,442 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 36 treesize of output 35 [2018-11-18 13:16:04,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-11-18 13:16:04,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-18 13:16:04,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,517 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-18 13:16:04,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2018-11-18 13:16:04,527 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:04,535 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,556 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 46 treesize of output 38 [2018-11-18 13:16:04,558 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 12 treesize of output 11 [2018-11-18 13:16:04,558 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,568 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:16:04,570 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 27 treesize of output 31 [2018-11-18 13:16:04,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 13:16:04,572 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,578 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,585 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:16:04,613 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-11-18 13:16:04,618 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 44 treesize of output 43 [2018-11-18 13:16:04,619 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,814 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 37 [2018-11-18 13:16:04,815 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:04,996 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 33 treesize of output 34 [2018-11-18 13:16:04,996 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:05,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-18 13:16:05,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 42 treesize of output 45 [2018-11-18 13:16:05,404 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:05,440 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 13:16:05,440 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:05,456 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:16:05,697 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-11-18 13:16:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-18 13:16:05,700 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:05,705 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:05,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2018-11-18 13:16:05,823 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:16:05,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-18 13:16:05,895 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:05,946 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:16:05,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-18 13:16:05,999 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:16:06,049 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:16:06,099 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:16:06,156 INFO L267 ElimStorePlain]: Start of recursive call 22: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-11-18 13:16:06,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 58 [2018-11-18 13:16:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-18 13:16:06,225 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:06,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-11-18 13:16:06,268 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:06,298 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-11-18 13:16:06,298 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:06,308 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:06,322 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:16:06,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:16:06,362 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-11-18 13:16:06,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2018-11-18 13:16:06,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-18 13:16:06,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:06,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-11-18 13:16:06,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 13:16:06,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-18 13:16:06,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:16:07,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:16:07,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-18 13:16:07,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:113 [2018-11-18 13:20:10,699 WARN L180 SmtUtils]: Spent 3.85 m on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-18 13:20:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:10,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:10,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,728 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 61 treesize of output 72 [2018-11-18 13:20:10,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,731 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 61 treesize of output 50 [2018-11-18 13:20:10,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-18 13:20:10,764 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 13:20:10,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 13:20:10,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20 Second operand 8 states. [2018-11-18 13:20:10,798 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 83 states and 97 transitions. Complement of second has 4 states. [2018-11-18 13:20:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 13:20:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:20:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-18 13:20:10,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 13:20:10,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:20:10,800 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:20:10,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:20:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:20:10,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:20:10,839 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 13:20:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,845 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 13:20:10,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,852 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 13:20:10,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 13:20:10,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:10,916 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 13:20:10,918 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 40 treesize of output 39 [2018-11-18 13:20:10,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:10,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-18 13:20:10,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2018-11-18 13:20:11,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-11-18 13:20:11,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:11,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2018-11-18 13:20:11,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:11,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 13:20:11,080 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:20:11,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 52 [2018-11-18 13:20:11,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-11-18 13:20:11,161 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:11,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 13:20:11,189 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:11,208 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 46 treesize of output 38 [2018-11-18 13:20:11,210 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 12 treesize of output 11 [2018-11-18 13:20:11,211 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:11,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:20:11,221 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 27 treesize of output 31 [2018-11-18 13:20:11,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 13:20:11,238 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,265 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,270 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:20:11,300 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-11-18 13:20:11,309 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 44 treesize of output 43 [2018-11-18 13:20:11,310 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:11,559 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 33 treesize of output 34 [2018-11-18 13:20:11,560 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,014 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 37 [2018-11-18 13:20:12,014 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-11-18 13:20:12,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-18 13:20:12,233 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,241 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2018-11-18 13:20:12,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-18 13:20:12,408 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:20:12,416 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:20:12,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-11-18 13:20:12,526 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:20:12,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 54 [2018-11-18 13:20:12,642 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 3 xjuncts. [2018-11-18 13:20:12,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2018-11-18 13:20:12,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 42 treesize of output 45 [2018-11-18 13:20:12,759 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 27 treesize of output 30 [2018-11-18 13:20:12,814 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:12,849 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 13:20:12,849 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:12,864 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:20:12,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 58 [2018-11-18 13:20:12,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-18 13:20:12,986 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,042 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 13:20:13,043 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:13,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 13:20:13,071 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,082 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,095 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:20:13,110 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-11-18 13:20:13,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 61 [2018-11-18 13:20:13,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-18 13:20:13,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-18 13:20:13,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:20:13,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-11-18 13:20:13,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:20:13,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:20:13,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-18 13:20:13,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:113 [2018-11-18 13:24:42,260 WARN L180 SmtUtils]: Spent 4.28 m on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-18 13:24:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:42,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:42,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,296 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 61 treesize of output 72 [2018-11-18 13:24:42,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,299 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 61 treesize of output 50 [2018-11-18 13:24:42,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-18 13:24:42,330 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 13:24:42,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 13:24:42,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20 Second operand 8 states. [2018-11-18 13:24:42,368 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 83 states and 97 transitions. Complement of second has 4 states. [2018-11-18 13:24:42,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-18 13:24:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:24:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-18 13:24:42,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 13:24:42,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:42,370 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:24:42,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:42,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:42,435 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 13:24:42,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,443 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 13:24:42,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,452 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 13:24:42,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 13:24:42,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:42,529 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 66 [2018-11-18 13:24:42,540 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 41 treesize of output 42 [2018-11-18 13:24:42,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:42,818 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 13:24:42,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,033 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 37 [2018-11-18 13:24:43,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-11-18 13:24:43,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-11-18 13:24:43,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 41 [2018-11-18 13:24:43,659 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,669 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-11-18 13:24:43,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-18 13:24:43,815 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,822 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2018-11-18 13:24:43,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 48 treesize of output 48 [2018-11-18 13:24:43,955 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,015 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-11-18 13:24:44,015 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 27 treesize of output 30 [2018-11-18 13:24:44,047 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,063 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-11-18 13:24:44,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-11-18 13:24:44,120 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,126 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:44,158 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 46 treesize of output 38 [2018-11-18 13:24:44,160 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 12 treesize of output 11 [2018-11-18 13:24:44,160 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:44,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:24:44,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-18 13:24:44,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 13:24:44,174 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,180 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,184 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:44,203 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-11-18 13:24:44,205 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 40 treesize of output 39 [2018-11-18 13:24:44,205 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-18 13:24:44,239 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2018-11-18 13:24:44,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-18 13:24:44,302 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 13:24:44,334 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-11-18 13:24:44,358 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,370 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 52 [2018-11-18 13:24:44,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-11-18 13:24:44,433 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 13:24:44,463 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,471 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,479 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,491 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-11-18 13:24:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:44,538 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 58 [2018-11-18 13:24:44,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 45 [2018-11-18 13:24:44,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-11-18 13:24:44,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-18 13:24:44,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:24:44,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-18 13:24:44,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:113 [2018-11-18 13:28:26,709 WARN L180 SmtUtils]: Spent 3.50 m on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-18 13:28:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:28:26,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:28:26,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:28:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:28:26,735 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 61 treesize of output 72 [2018-11-18 13:28:26,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:28:26,738 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 61 treesize of output 50 [2018-11-18 13:28:26,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:28:26,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:28:26,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:28:26,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-11-18 13:28:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:28:26,763 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 13:28:26,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20 Second operand 8 states. [2018-11-18 13:28:50,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 97 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 122 states and 142 transitions. Complement of second has 16 states. [2018-11-18 13:28:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 13:28:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 13:28:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2018-11-18 13:28:50,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 13:28:50,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:28:50,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-18 13:28:50,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:28:50,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 13:28:50,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:28:50,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 142 transitions. [2018-11-18 13:28:50,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:28:50,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 0 states and 0 transitions. [2018-11-18 13:28:50,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:28:50,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:28:50,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:28:50,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:28:50,885 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:50,885 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:50,885 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:28:50,886 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 13:28:50,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:28:50,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:28:50,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:28:50,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:28:50 BoogieIcfgContainer [2018-11-18 13:28:50,892 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:28:50,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:28:50,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:28:50,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:28:50,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:41" (3/4) ... [2018-11-18 13:28:50,900 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:28:50,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:28:50,901 INFO L168 Benchmark]: Toolchain (without parser) took 790157.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.7 MB). Free memory was 955.7 MB in the beginning and 1.0 GB in the end (delta: -73.9 MB). Peak memory consumption was 286.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,902 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:28:50,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.63 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 934.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,902 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,902 INFO L168 Benchmark]: RCFGBuilder took 282.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,903 INFO L168 Benchmark]: BuchiAutomizer took 789380.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.7 MB). Peak memory consumption was 306.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:28:50,903 INFO L168 Benchmark]: Witness Printer took 8.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:28:50,905 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.63 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 934.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 789380.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.7 MB). Peak memory consumption was 306.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.14 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 - 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 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[r][r] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 1 and consists of 9 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 789.3s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 13.9s. Construction of modules took 12.5s. Büchi inclusion checks took 762.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 145 SDtfs, 248 SDslu, 208 SDs, 0 SdLazy, 528 SolverSat, 85 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital4297 mio100 ax102 hnf100 lsp96 ukn24 mio100 lsp34 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process Received shutdown request...