./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/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_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/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-635dfa2 [2018-12-09 02:47:09,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:47:09,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:47:09,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:47:09,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:47:09,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:47:09,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:47:09,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:47:09,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:47:09,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:47:09,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:47:09,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:47:09,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:47:09,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:47:09,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:47:09,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:47:09,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:47:09,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:47:09,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:47:09,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:47:09,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:47:09,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:47:09,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:47:09,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:47:09,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:47:09,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:47:09,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:47:09,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:47:09,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:47:09,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:47:09,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:47:09,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:47:09,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:47:09,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:47:09,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:47:09,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:47:09,205 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 02:47:09,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:47:09,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:47:09,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:47:09,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 02:47:09,214 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 02:47:09,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 02:47:09,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 02:47:09,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 02:47:09,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 02:47:09,215 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 02:47:09,216 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 02:47:09,216 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_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/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-12-09 02:47:09,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:47:09,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:47:09,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:47:09,242 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:47:09,242 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:47:09,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-12-09 02:47:09,277 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/data/2365ffe9a/d2357aa69e3e4588b498106adb19a720/FLAGbd96f3fee [2018-12-09 02:47:09,702 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:47:09,703 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca_true-termination.c.i [2018-12-09 02:47:09,709 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/data/2365ffe9a/d2357aa69e3e4588b498106adb19a720/FLAGbd96f3fee [2018-12-09 02:47:09,717 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/data/2365ffe9a/d2357aa69e3e4588b498106adb19a720 [2018-12-09 02:47:09,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:47:09,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:47:09,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:47:09,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:47:09,724 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:47:09,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:47:09" (1/1) ... [2018-12-09 02:47:09,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09, skipping insertion in model container [2018-12-09 02:47:09,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:47:09" (1/1) ... [2018-12-09 02:47:09,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:47:09,759 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:47:09,921 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:47:09,927 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:47:09,988 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:47:10,017 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:47:10,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10 WrapperNode [2018-12-09 02:47:10,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:47:10,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:47:10,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:47:10,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:47:10,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:47:10,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:47:10,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:47:10,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:47:10,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... [2018-12-09 02:47:10,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:47:10,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:47:10,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:47:10,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:47:10,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:47:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 02:47:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:47:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:47:10,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:47:10,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:47:10,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:47:10,237 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:47:10,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:47:10 BoogieIcfgContainer [2018-12-09 02:47:10,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:47:10,237 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 02:47:10,237 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 02:47:10,239 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 02:47:10,240 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:47:10,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 02:47:09" (1/3) ... [2018-12-09 02:47:10,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35731614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:47:10, skipping insertion in model container [2018-12-09 02:47:10,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:47:10,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:10" (2/3) ... [2018-12-09 02:47:10,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35731614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:47:10, skipping insertion in model container [2018-12-09 02:47:10,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:47:10,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:47:10" (3/3) ... [2018-12-09 02:47:10,242 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca_true-termination.c.i [2018-12-09 02:47:10,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 02:47:10,272 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 02:47:10,272 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 02:47:10,272 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 02:47:10,272 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:47:10,273 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:47:10,273 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 02:47:10,273 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:47:10,273 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 02:47:10,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 02:47:10,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:10,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:10,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:10,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:10,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:47:10,299 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 02:47:10,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 02:47:10,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:10,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:10,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:10,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:10,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:47:10,305 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true 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;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); 9#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 15#L553-2true call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 5#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 10#L555-2true [2018-12-09 02:47:10,306 INFO L796 eck$LassoCheckResult]: Loop: 10#L555-2true call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 4#L555true 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; 6#L557-3true assume !true; 11#L557-4true 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; 10#L555-2true [2018-12-09 02:47:10,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-09 02:47:10,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2018-12-09 02:47:10,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:47:10,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:47:10,420 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:47:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 02:47:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 02:47:10,429 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-09 02:47:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:10,433 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-09 02:47:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 02:47:10,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-09 02:47:10,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:10,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-09 02:47:10,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 02:47:10,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 02:47:10,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-09 02:47:10,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:47:10,439 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 02:47:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-09 02:47:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 02:47:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 02:47:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-09 02:47:10,455 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 02:47:10,455 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 02:47:10,455 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 02:47:10,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-09 02:47:10,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:10,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:10,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:10,456 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:10,456 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:10,456 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 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;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); 39#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 42#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 45#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 41#L555-2 [2018-12-09 02:47:10,457 INFO L796 eck$LassoCheckResult]: Loop: 41#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 43#L555 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; 47#L557-3 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); 46#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 40#L557-4 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; 41#L555-2 [2018-12-09 02:47:10,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2018-12-09 02:47:10,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:10,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:10,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:10,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2018-12-09 02:47:10,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2018-12-09 02:47:10,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:10,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:10,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:10,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:10,761 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-12-09 02:47:10,823 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:10,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:10,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:10,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:10,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:10,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:10,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:10,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:10,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-09 02:47:10,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:10,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:10,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,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-12-09 02:47:10,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-12-09 02:47:10,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,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-12-09 02:47:10,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:10,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:11,057 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-12-09 02:47:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:11,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:11,408 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:11,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:11,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:11,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:11,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:11,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:11,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:11,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:11,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:11,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:11,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:11,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:11,483 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:11,497 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 02:47:11,497 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 02:47:11,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:11,499 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:47:11,499 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:11,500 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-12-09 02:47:11,561 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 02:47:11,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:11,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:11,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:11,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:11,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:11,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:11,620 INFO L478 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-12-09 02:47:11,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:11,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:11,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:11,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:11,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:11,669 INFO L478 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-12-09 02:47:11,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-09 02:47:11,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:11,698 INFO L478 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-12-09 02:47:11,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:11,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:11,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:11,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-12-09 02:47:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:11,792 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-12-09 02:47:11,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-09 02:47:11,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 31 states and 38 transitions. Complement of second has 14 states. [2018-12-09 02:47:11,877 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-12-09 02:47:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-09 02:47:11,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-09 02:47:11,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:11,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-09 02:47:11,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:11,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 02:47:11,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:11,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-09 02:47:11,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 02:47:11,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2018-12-09 02:47:11,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-09 02:47:11,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 02:47:11,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-12-09 02:47:11,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:11,883 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-09 02:47:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-12-09 02:47:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-09 02:47:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 02:47:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-09 02:47:11,885 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 02:47:11,885 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 02:47:11,885 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 02:47:11,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-09 02:47:11,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:11,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:11,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:11,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:11,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:11,886 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 248#L-1 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;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); 249#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 250#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 259#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; 251#L555-2 [2018-12-09 02:47:11,886 INFO L796 eck$LassoCheckResult]: Loop: 251#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 252#L555 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; 261#L557-3 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); 266#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 256#L557-4 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; 251#L555-2 [2018-12-09 02:47:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2018-12-09 02:47:11,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:11,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2018-12-09 02:47:11,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:11,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:11,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:11,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2018-12-09 02:47:11,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:12,153 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-12-09 02:47:12,203 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:12,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:12,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:12,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:12,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:12,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:12,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:12,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:12,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-09 02:47:12,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:12,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:12,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-12-09 02:47:12,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-12-09 02:47:12,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,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-12-09 02:47:12,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,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-12-09 02:47:12,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-12-09 02:47:12,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-12-09 02:47:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:12,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:12,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:12,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:12,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:12,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:12,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:12,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:12,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,786 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:12,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:12,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:12,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:12,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:12,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:12,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:12,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:12,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:12,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:12,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:12,812 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 02:47:12,812 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 02:47:12,813 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:12,813 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:47:12,813 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:12,814 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-12-09 02:47:12,868 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 02:47:12,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:12,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:12,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:12,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:12,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:12,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:12,903 INFO L478 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-12-09 02:47:12,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:12,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:12,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:12,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:12,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:12,945 INFO L478 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-12-09 02:47:12,955 INFO L478 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-12-09 02:47:12,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:12,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-09 02:47:12,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:12,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:13,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:13,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:56 [2018-12-09 02:47:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:13,068 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-12-09 02:47:13,069 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-12-09 02:47:13,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 40 states and 49 transitions. Complement of second has 14 states. [2018-12-09 02:47:13,129 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-12-09 02:47:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-09 02:47:13,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2018-12-09 02:47:13,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:13,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2018-12-09 02:47:13,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:13,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-09 02:47:13,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:13,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-12-09 02:47:13,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 02:47:13,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2018-12-09 02:47:13,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-09 02:47:13,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 02:47:13,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-12-09 02:47:13,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:13,132 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-09 02:47:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-12-09 02:47:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-09 02:47:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 02:47:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-09 02:47:13,133 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 02:47:13,133 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 02:47:13,133 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 02:47:13,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-09 02:47:13,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:13,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:13,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:13,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:13,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 02:47:13,134 INFO L794 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 476#L-1 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;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); 477#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 485#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 487#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 493#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 484#L555 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; 494#L557-3 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); 488#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 489#L557-3 [2018-12-09 02:47:13,134 INFO L796 eck$LassoCheckResult]: Loop: 489#L557-3 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); 492#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 489#L557-3 [2018-12-09 02:47:13,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2018-12-09 02:47:13,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2018-12-09 02:47:13,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:13,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2018-12-09 02:47:13,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:13,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:13,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:13,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:13,490 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2018-12-09 02:47:13,564 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:13,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:13,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:13,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:13,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:13,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:13,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:13,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:13,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 02:47:13,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:13,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,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-12-09 02:47:13,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,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-12-09 02:47:13,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-12-09 02:47:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,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-12-09 02:47:13,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-12-09 02:47:13,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-12-09 02:47:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,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-12-09 02:47:13,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-12-09 02:47:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,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-12-09 02:47:13,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-12-09 02:47:13,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:13,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:13,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:13,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-12-09 02:47:13,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,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-12-09 02:47:13,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:13,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:13,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:13,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:13,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,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-12-09 02:47:13,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,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-12-09 02:47:13,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:13,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,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-12-09 02:47:13,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:13,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:13,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:13,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,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-12-09 02:47:13,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:13,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:13,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:13,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:13,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:13,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:13,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:13,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:13,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:13,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:14,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:14,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:14,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,019 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:14,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,020 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:14,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,022 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:14,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:14,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:14,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:14,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-12-09 02:47:14,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:14,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:14,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:14,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:14,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:14,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:14,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:14,037 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 02:47:14,037 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:47:14,038 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:14,038 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-09 02:47:14,038 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:14,038 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)_3, 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 + 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~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-12-09 02:47:14,092 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2018-12-09 02:47:14,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:14,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:14,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:14,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:14,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,131 INFO L478 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-12-09 02:47:14,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,144 INFO L478 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-12-09 02:47:14,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:47:14,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,162 INFO L478 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-12-09 02:47:14,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 02:47:14,165 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,182 INFO L478 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-12-09 02:47:14,183 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:14,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:14,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:14,209 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-12-09 02:47:14,209 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2018-12-09 02:47:14,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,251 INFO L478 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-12-09 02:47:14,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-09 02:47:14,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 02:47:14,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,293 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-12-09 02:47:14,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-12-09 02:47:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:14,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:14,322 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-12-09 02:47:14,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-09 02:47:14,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 25 states and 32 transitions. Complement of second has 10 states. [2018-12-09 02:47:14,377 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-12-09 02:47:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 02:47:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-09 02:47:14,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 02:47:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-09 02:47:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 02:47:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:14,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-12-09 02:47:14,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:14,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2018-12-09 02:47:14,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 02:47:14,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 02:47:14,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-12-09 02:47:14,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:14,379 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-09 02:47:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-12-09 02:47:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 02:47:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 02:47:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-09 02:47:14,380 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 02:47:14,380 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 02:47:14,380 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 02:47:14,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-09 02:47:14,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:47:14,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:14,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:14,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:14,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 02:47:14,381 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 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;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); 675#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 683#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 685#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 693#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 682#L555 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; 689#L557-3 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); 696#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 695#L557-3 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); 686#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2018-12-09 02:47:14,381 INFO L796 eck$LassoCheckResult]: Loop: 676#L557-4 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; 677#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 680#L555 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; 691#L557-3 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); 692#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2018-12-09 02:47:14,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2018-12-09 02:47:14,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:14,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:14,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2018-12-09 02:47:14,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:14,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:14,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2018-12-09 02:47:14,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:47:14,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:47:14,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f1cc0a7-d3a2-45ef-a213-16a70da6b950/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:47:14,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:14,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:14,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 02:47:14,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 02:47:14,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 02:47:14,659 INFO L478 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-12-09 02:47:14,661 INFO L478 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-12-09 02:47:14,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-12-09 02:47:14,715 INFO L478 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-12-09 02:47:14,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 02:47:14,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,732 INFO L478 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-12-09 02:47:14,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 02:47:14,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:77, output treesize:37 [2018-12-09 02:47:14,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:14,773 INFO L478 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-12-09 02:47:14,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 02:47:14,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,787 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-12-09 02:47:14,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2018-12-09 02:47:14,813 INFO L478 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-12-09 02:47:14,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 02:47:14,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 02:47:14,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 02:47:14,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:14,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-12-09 02:47:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:47:14,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:47:14,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-12-09 02:47:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 02:47:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:47:14,917 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-12-09 02:47:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:47:15,153 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 02:47:15,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:47:15,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-09 02:47:15,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 02:47:15,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 41 transitions. [2018-12-09 02:47:15,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 02:47:15,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 02:47:15,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-12-09 02:47:15,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:15,155 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-09 02:47:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-12-09 02:47:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-12-09 02:47:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 02:47:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-09 02:47:15,156 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-09 02:47:15,156 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-09 02:47:15,156 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 02:47:15,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-09 02:47:15,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 02:47:15,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:15,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:15,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:15,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-09 02:47:15,157 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 812#L-1 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;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); 813#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 818#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 820#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 828#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 832#L555 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; 831#L557-3 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); 830#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 829#L557-3 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); 827#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 834#L557-4 [2018-12-09 02:47:15,157 INFO L796 eck$LassoCheckResult]: Loop: 834#L557-4 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; 816#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 817#L555 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; 825#L557-3 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); 821#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 822#L557-3 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); 826#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 834#L557-4 [2018-12-09 02:47:15,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 2 times [2018-12-09 02:47:15,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:15,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1675227762, now seen corresponding path program 1 times [2018-12-09 02:47:15,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:15,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1665390371, now seen corresponding path program 2 times [2018-12-09 02:47:15,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:15,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:47:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:15,339 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-12-09 02:47:15,657 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 126 [2018-12-09 02:47:15,746 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:15,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:15,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:15,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:15,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:15,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:15,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:15,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:15,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-09 02:47:15,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:15,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:15,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:15,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:15,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:15,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,046 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-09 02:47:16,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:16,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:16,400 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:16,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:16,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:16,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:16,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:16,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:16,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:16,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,420 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:16,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:16,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,424 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:16,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:16,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,432 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:16,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:16,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:16,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:16,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:16,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:16,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:16,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:16,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:16,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:16,449 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:16,464 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 02:47:16,465 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 02:47:16,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:16,466 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:47:16,466 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:16,466 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-12-09 02:47:16,515 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 02:47:16,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:16,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:16,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:16,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:16,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:16,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:16,546 INFO L478 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-12-09 02:47:16,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:16,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:16,591 INFO L478 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-12-09 02:47:16,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-09 02:47:16,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,623 INFO L478 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-12-09 02:47:16,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,668 INFO L478 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-12-09 02:47:16,678 INFO L478 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-12-09 02:47:16,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:16,743 INFO L478 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-12-09 02:47:16,744 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,810 INFO L478 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-12-09 02:47:16,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-09 02:47:16,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 02:47:16,927 INFO L478 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-12-09 02:47:16,931 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 02:47:16,931 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:16,984 INFO L478 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-12-09 02:47:16,985 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,030 INFO L478 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-12-09 02:47:17,031 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:17,063 INFO L478 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-12-09 02:47:17,064 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:17,082 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:17,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:17,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:17,132 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:63, output treesize:95 [2018-12-09 02:47:17,193 INFO L478 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-12-09 02:47:17,197 INFO L478 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-12-09 02:47:17,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,247 INFO L478 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-12-09 02:47:17,257 INFO L478 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-12-09 02:47:17,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:17,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:17,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2018-12-09 02:47:17,349 INFO L478 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-12-09 02:47:17,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,387 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-12-09 02:47:17,387 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:161, output treesize:191 [2018-12-09 02:47:17,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:17,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 71 [2018-12-09 02:47:17,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:17,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 70 [2018-12-09 02:47:17,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:17,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:17,501 INFO L478 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-12-09 02:47:17,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:17,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:17,545 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-12-09 02:47:17,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:118 [2018-12-09 02:47:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:17,674 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-12-09 02:47:17,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-09 02:47:17,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-12-09 02:47:17,881 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-12-09 02:47:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 02:47:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-12-09 02:47:17,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 7 letters. [2018-12-09 02:47:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:17,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 18 letters. Loop has 7 letters. [2018-12-09 02:47:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:17,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 14 letters. [2018-12-09 02:47:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:17,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-12-09 02:47:17,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 02:47:17,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 63 transitions. [2018-12-09 02:47:17,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-09 02:47:17,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-09 02:47:17,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2018-12-09 02:47:17,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:17,884 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-09 02:47:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2018-12-09 02:47:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-09 02:47:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 02:47:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-09 02:47:17,886 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-09 02:47:17,886 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-09 02:47:17,886 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 02:47:17,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2018-12-09 02:47:17,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 02:47:17,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:17,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:17,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:17,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-09 02:47:17,887 INFO L794 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 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;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); 1088#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1096#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1098#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1107#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1129#L555 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; 1128#L557-3 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); 1126#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 1124#L557-3 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); 1123#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1109#L557-4 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; 1093#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1094#L555 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; 1130#L557-3 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); 1099#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 1100#L557-3 [2018-12-09 02:47:17,887 INFO L796 eck$LassoCheckResult]: Loop: 1100#L557-3 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); 1105#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 1116#L557-3 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); 1117#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1089#L557-4 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; 1090#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1103#L555 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; 1100#L557-3 [2018-12-09 02:47:17,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603334, now seen corresponding path program 3 times [2018-12-09 02:47:17,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:17,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:17,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1583190302, now seen corresponding path program 2 times [2018-12-09 02:47:17,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:17,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503927, now seen corresponding path program 4 times [2018-12-09 02:47:17,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:17,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:17,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:17,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:18,925 WARN L180 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 155 [2018-12-09 02:47:19,106 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 02:47:19,109 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:19,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:19,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:19,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:19,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:19,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:19,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:19,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:19,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-09 02:47:19,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:19,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:19,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:19,340 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-09 02:47:19,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:19,645 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:19,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:19,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:19,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:19,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:19,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:19,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:19,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:19,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:19,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:19,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:19,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:19,687 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:19,706 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 02:47:19,706 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 02:47:19,706 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:19,707 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:47:19,707 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:19,707 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)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_5 Supporting invariants [] [2018-12-09 02:47:19,770 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 02:47:19,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:19,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:19,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:19,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:19,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:19,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:19,814 INFO L478 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-12-09 02:47:19,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:19,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:19,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:19,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:19,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:19,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:19,855 INFO L478 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-12-09 02:47:19,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:19,879 INFO L478 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 28 treesize of output 23 [2018-12-09 02:47:19,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:19,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:19,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:19,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-09 02:47:20,014 INFO L478 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 66 treesize of output 69 [2018-12-09 02:47:20,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-09 02:47:20,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,056 INFO L478 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 51 treesize of output 51 [2018-12-09 02:47:20,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,109 INFO L478 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 56 treesize of output 92 [2018-12-09 02:47:20,123 INFO L478 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 63 treesize of output 63 [2018-12-09 02:47:20,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:20,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,251 INFO L478 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 42 treesize of output 74 [2018-12-09 02:47:20,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:20,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,336 INFO L478 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 49 treesize of output 56 [2018-12-09 02:47:20,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 02:47:20,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 82 [2018-12-09 02:47:20,550 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 02:47:20,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-09 02:47:20,635 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,690 INFO L478 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 45 treesize of output 55 [2018-12-09 02:47:20,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:20,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:20,726 INFO L478 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 41 treesize of output 57 [2018-12-09 02:47:20,727 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:20,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:20,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:20,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:20,796 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-09 02:47:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:20,866 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-12-09 02:47:20,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-09 02:47:21,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 123 states and 144 transitions. Complement of second has 16 states. [2018-12-09 02:47:21,096 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-12-09 02:47:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-12-09 02:47:21,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-09 02:47:21,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:21,097 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:21,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:21,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:21,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:21,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,129 INFO L478 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-12-09 02:47:21,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:21,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:21,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:21,159 INFO L478 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 28 treesize of output 23 [2018-12-09 02:47:21,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,182 INFO L478 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-12-09 02:47:21,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:21,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:21,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:21,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-09 02:47:21,325 INFO L478 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 66 treesize of output 69 [2018-12-09 02:47:21,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-09 02:47:21,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,366 INFO L478 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 51 treesize of output 51 [2018-12-09 02:47:21,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-12-09 02:47:21,411 INFO L478 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 52 treesize of output 52 [2018-12-09 02:47:21,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:21,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:21,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,476 INFO L478 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 56 treesize of output 92 [2018-12-09 02:47:21,482 INFO L478 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 83 treesize of output 72 [2018-12-09 02:47:21,482 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,566 INFO L478 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 42 treesize of output 74 [2018-12-09 02:47:21,567 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:21,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,630 INFO L478 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 45 treesize of output 55 [2018-12-09 02:47:21,631 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:21,715 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 02:47:21,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 82 [2018-12-09 02:47:21,799 INFO L478 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 63 treesize of output 63 [2018-12-09 02:47:21,800 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:21,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-09 02:47:21,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:21,958 INFO L478 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 41 treesize of output 57 [2018-12-09 02:47:21,958 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:21,980 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,030 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-09 02:47:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:22,104 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-12-09 02:47:22,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-09 02:47:22,585 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-09 02:47:22,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 123 states and 144 transitions. Complement of second has 16 states. [2018-12-09 02:47:22,596 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-12-09 02:47:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-12-09 02:47:22,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-09 02:47:22,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:22,597 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:22,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:22,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:22,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:22,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:22,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:22,645 INFO L478 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-12-09 02:47:22,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:22,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:22,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:22,688 INFO L478 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-12-09 02:47:22,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,710 INFO L478 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 28 treesize of output 23 [2018-12-09 02:47:22,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:22,743 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:66 [2018-12-09 02:47:22,844 INFO L478 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 66 treesize of output 69 [2018-12-09 02:47:22,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-12-09 02:47:22,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,885 INFO L478 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 51 treesize of output 51 [2018-12-09 02:47:22,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:22,936 INFO L478 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 57 treesize of output 71 [2018-12-09 02:47:22,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-09 02:47:22,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:22,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:22,963 INFO L478 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 41 treesize of output 57 [2018-12-09 02:47:22,964 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:22,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:23,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:23,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:23,036 INFO L478 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 56 treesize of output 92 [2018-12-09 02:47:23,046 INFO L478 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 63 treesize of output 63 [2018-12-09 02:47:23,047 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:23,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:23,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:23,158 INFO L478 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 42 treesize of output 74 [2018-12-09 02:47:23,159 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:23,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:23,242 INFO L478 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 49 treesize of output 56 [2018-12-09 02:47:23,242 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:23,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 02:47:23,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:23,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:23,391 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:82, output treesize:129 [2018-12-09 02:47:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:23,462 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-12-09 02:47:23,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-12-09 02:47:23,715 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-12-09 02:47:23,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 54 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 126 states and 149 transitions. Complement of second has 19 states. [2018-12-09 02:47:23,721 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-12-09 02:47:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-09 02:47:23,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-09 02:47:23,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:23,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2018-12-09 02:47:23,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:23,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2018-12-09 02:47:23,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:23,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 149 transitions. [2018-12-09 02:47:23,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 02:47:23,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 79 states and 96 transitions. [2018-12-09 02:47:23,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 02:47:23,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-09 02:47:23,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 96 transitions. [2018-12-09 02:47:23,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:23,726 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 96 transitions. [2018-12-09 02:47:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 96 transitions. [2018-12-09 02:47:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2018-12-09 02:47:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 02:47:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-12-09 02:47:23,730 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-09 02:47:23,730 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-09 02:47:23,730 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 02:47:23,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-12-09 02:47:23,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-09 02:47:23,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:23,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:23,732 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:23,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 02:47:23,732 INFO L794 eck$LassoCheckResult]: Stem: 1927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1917#L-1 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;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); 1918#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 1926#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1928#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 1935#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1943#L555 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; 1942#L557-3 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); 1939#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 1940#L557-3 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); 1951#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 1919#L557-4 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; 1921#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 1924#L555 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; 1933#L557-3 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); 1929#L557-1 [2018-12-09 02:47:23,732 INFO L796 eck$LassoCheckResult]: Loop: 1929#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 1930#L557-3 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); 1929#L557-1 [2018-12-09 02:47:23,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1696071320, now seen corresponding path program 5 times [2018-12-09 02:47:23,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:23,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:23,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2044, now seen corresponding path program 2 times [2018-12-09 02:47:23,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:23,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:23,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2131932253, now seen corresponding path program 6 times [2018-12-09 02:47:23,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:24,433 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 152 [2018-12-09 02:47:24,657 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-09 02:47:24,660 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:24,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:24,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:24,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:24,660 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:24,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:24,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:24,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:24,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-09 02:47:24,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:24,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:24,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,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-12-09 02:47:24,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-12-09 02:47:24,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-12-09 02:47:24,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,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-12-09 02:47:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:24,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:25,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:25,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:25,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-12-09 02:47:25,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:25,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:25,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:25,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,169 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:25,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,170 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:25,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,179 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:25,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,179 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:25,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:25,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:25,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:25,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:25,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:25,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:25,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:25,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:25,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:25,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:25,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:25,208 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 02:47:25,208 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:47:25,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:25,209 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-09 02:47:25,209 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:25,209 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, 1*ULTIMATE.start_gcd_#t~mem12 + 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_6 - 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_6 - 1*ULTIMATE.start_gcd_#t~mem11 >= 0] [2018-12-09 02:47:25,288 INFO L297 tatePredicateManager]: 20 out of 25 supporting invariants were superfluous and have been removed [2018-12-09 02:47:25,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:25,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:25,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:25,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:25,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:25,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:25,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:25,336 INFO L478 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-12-09 02:47:25,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 02:47:25,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:25,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-09 02:47:25,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 02:47:25,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:25,387 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:25,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 02:47:25,389 INFO L478 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-12-09 02:47:25,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:25,419 INFO L478 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-12-09 02:47:25,423 INFO L478 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-12-09 02:47:25,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-09 02:47:25,632 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:25,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 02:47:25,953 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,320 INFO L478 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 41 [2018-12-09 02:47:26,323 INFO L478 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-12-09 02:47:26,323 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,328 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,482 INFO L478 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-12-09 02:47:26,482 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,617 INFO L478 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-12-09 02:47:26,625 INFO L478 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-12-09 02:47:26,625 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,633 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,724 INFO L478 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-12-09 02:47:26,728 INFO L478 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 49 treesize of output 41 [2018-12-09 02:47:26,728 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:26,786 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:26,840 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:26,891 INFO L478 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-12-09 02:47:26,891 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:26,939 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:26,991 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:27,048 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-12-09 02:47:27,131 INFO L478 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 31 treesize of output 55 [2018-12-09 02:47:27,141 INFO L478 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 35 treesize of output 41 [2018-12-09 02:47:27,142 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-09 02:47:27,199 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 02:47:27,218 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,229 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:27,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-09 02:47:27,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-09 02:47:27,263 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,290 INFO L478 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-12-09 02:47:27,291 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,326 INFO L478 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-12-09 02:47:27,330 INFO L478 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-12-09 02:47:27,330 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,354 INFO L478 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-12-09 02:47:27,354 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,362 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,390 INFO L478 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-12-09 02:47:27,398 INFO L478 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-12-09 02:47:27,398 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,420 INFO L478 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-12-09 02:47:27,420 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,426 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,433 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,442 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-12-09 02:47:27,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:27,480 INFO L478 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-12-09 02:47:27,483 INFO L478 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-12-09 02:47:27,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,523 INFO L478 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-12-09 02:47:27,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:27,549 INFO L478 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-12-09 02:47:27,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:27,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:27,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:27,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-09 02:47:28,751 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-09 02:47:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:28,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:28,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-09 02:47:28,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-09 02:47:28,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-09 02:47:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:28,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-09 02:47:28,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-09 02:47:28,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 50 states and 63 transitions. Complement of second has 4 states. [2018-12-09 02:47:28,820 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-12-09 02:47:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-09 02:47:28,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-09 02:47:28,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:28,820 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:28,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:28,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:28,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:28,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,857 INFO L478 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-12-09 02:47:28,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:28,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 02:47:28,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:28,949 INFO L478 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-12-09 02:47:28,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 02:47:28,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:29,172 INFO L478 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-12-09 02:47:29,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:29,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 02:47:29,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:29,719 INFO L478 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-12-09 02:47:29,723 INFO L478 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-12-09 02:47:29,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:29,752 INFO L478 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-12-09 02:47:29,753 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:29,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:29,882 INFO L478 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 35 treesize of output 52 [2018-12-09 02:47:29,884 INFO L478 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-12-09 02:47:29,885 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:29,912 INFO L478 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-12-09 02:47:29,912 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:29,924 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:30,042 INFO L478 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-12-09 02:47:30,046 INFO L478 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 44 treesize of output 41 [2018-12-09 02:47:30,047 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:30,094 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:47:30,128 INFO L478 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-12-09 02:47:30,128 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,159 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-12-09 02:47:30,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:30,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-09 02:47:30,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 02:47:30,201 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:30,211 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:30,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 02:47:30,213 INFO L478 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-12-09 02:47:30,213 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,217 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,221 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:30,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-09 02:47:30,242 INFO L478 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-12-09 02:47:30,242 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-09 02:47:30,271 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,300 INFO L478 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-12-09 02:47:30,303 INFO L478 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-12-09 02:47:30,303 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,309 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,340 INFO L478 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-12-09 02:47:30,346 INFO L478 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-12-09 02:47:30,346 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,373 INFO L478 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-12-09 02:47:30,374 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:30,384 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:30,394 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:30,406 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-12-09 02:47:30,456 INFO L478 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-12-09 02:47:30,460 INFO L478 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 47 treesize of output 37 [2018-12-09 02:47:30,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,504 INFO L478 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-12-09 02:47:30,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:30,530 INFO L478 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-12-09 02:47:30,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:30,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:30,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:30,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-09 02:47:31,708 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-09 02:47:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:31,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:31,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-09 02:47:31,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-09 02:47:31,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-09 02:47:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:31,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-09 02:47:31,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-09 02:47:31,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 50 states and 63 transitions. Complement of second has 4 states. [2018-12-09 02:47:31,774 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-12-09 02:47:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-09 02:47:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-09 02:47:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:31,775 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:31,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:31,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:31,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:31,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,812 INFO L478 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-12-09 02:47:31,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 02:47:31,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-09 02:47:31,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 02:47:31,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,869 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:31,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 02:47:31,871 INFO L478 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-12-09 02:47:31,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:31,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-09 02:47:31,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-09 02:47:31,896 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,925 INFO L478 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-12-09 02:47:31,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,962 INFO L478 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-12-09 02:47:31,967 INFO L478 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-12-09 02:47:31,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:31,994 INFO L478 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-12-09 02:47:31,994 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:32,003 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:32,045 INFO L478 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-12-09 02:47:32,048 INFO L478 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-12-09 02:47:32,048 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,082 INFO L478 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 24 treesize of output 30 [2018-12-09 02:47:32,082 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:32,089 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:32,118 INFO L478 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-12-09 02:47:32,121 INFO L478 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-12-09 02:47:32,121 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 02:47:32,316 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-09 02:47:32,661 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,849 INFO L478 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-12-09 02:47:32,857 INFO L478 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-12-09 02:47:32,857 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:32,863 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,170 INFO L478 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-12-09 02:47:33,172 INFO L478 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-12-09 02:47:33,172 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,178 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,281 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:33,291 INFO L478 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 58 [2018-12-09 02:47:33,291 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:33,408 INFO L478 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 34 [2018-12-09 02:47:33,415 INFO L478 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 20 treesize of output 26 [2018-12-09 02:47:33,415 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:33,422 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,532 INFO L478 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-12-09 02:47:33,542 INFO L478 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 38 treesize of output 44 [2018-12-09 02:47:33,542 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:33,584 INFO L478 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-12-09 02:47:33,584 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,604 INFO L478 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-12-09 02:47:33,604 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,611 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,625 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,635 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 1 variables, input treesize:63, output treesize:23 [2018-12-09 02:47:33,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:33,677 INFO L478 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-12-09 02:47:33,680 INFO L478 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-12-09 02:47:33,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,721 INFO L478 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-12-09 02:47:33,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:33,747 INFO L478 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-12-09 02:47:33,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:33,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:33,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:33,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-09 02:47:34,928 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-09 02:47:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:34,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:34,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:34,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:34,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-09 02:47:34,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:34,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-09 02:47:34,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:34,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:34,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-09 02:47:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:34,965 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 2 loop predicates [2018-12-09 02:47:34,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-09 02:47:35,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 64 states and 80 transitions. Complement of second has 8 states. [2018-12-09 02:47:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 0 non-accepting loop states 2 accepting loop states [2018-12-09 02:47:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-09 02:47:35,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-09 02:47:35,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:35,052 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:35,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:35,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:35,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:35,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,087 INFO L478 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-12-09 02:47:35,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 02:47:35,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-12-09 02:47:35,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-09 02:47:35,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,168 INFO L478 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-12-09 02:47:35,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,193 INFO L478 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-12-09 02:47:35,201 INFO L478 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-12-09 02:47:35,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:35,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,236 INFO L478 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-12-09 02:47:35,247 INFO L478 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-12-09 02:47:35,247 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:35,273 INFO L478 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-12-09 02:47:35,273 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,279 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-09 02:47:35,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 02:47:35,293 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,301 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:35,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-09 02:47:35,304 INFO L478 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-12-09 02:47:35,304 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,308 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,314 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:35,337 INFO L478 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-12-09 02:47:35,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-09 02:47:35,345 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,547 INFO L478 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-12-09 02:47:35,547 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:35,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-12-09 02:47:35,722 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,092 INFO L478 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-12-09 02:47:36,097 INFO L478 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-12-09 02:47:36,097 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,126 INFO L478 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-12-09 02:47:36,126 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,139 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,361 INFO L478 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 35 treesize of output 52 [2018-12-09 02:47:36,364 INFO L478 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-12-09 02:47:36,364 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,390 INFO L478 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-12-09 02:47:36,390 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,402 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,506 INFO L478 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-12-09 02:47:36,509 INFO L478 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-12-09 02:47:36,509 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,513 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,533 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,544 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 1 variables, input treesize:63, output treesize:53 [2018-12-09 02:47:36,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:36,593 INFO L478 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-12-09 02:47:36,601 INFO L478 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-12-09 02:47:36,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:36,646 INFO L478 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-12-09 02:47:36,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,671 INFO L478 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-12-09 02:47:36,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:36,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:36,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:36,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:113 [2018-12-09 02:47:37,870 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-12-09 02:47:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:37,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:37,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:37,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:37,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-09 02:47:37,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:37,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-09 02:47:37,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:37,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:37,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:37,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:36 [2018-12-09 02:47:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:47:37,909 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-12-09 02:47:37,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-12-09 02:47:37,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 63 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 66 states and 81 transitions. Complement of second has 10 states. [2018-12-09 02:47:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-09 02:47:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:47:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-09 02:47:37,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-09 02:47:37,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:37,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-09 02:47:37,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:37,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 02:47:37,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:37,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2018-12-09 02:47:37,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 02:47:37,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 59 states and 73 transitions. [2018-12-09 02:47:37,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 02:47:37,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 02:47:37,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2018-12-09 02:47:37,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:47:37,994 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-12-09 02:47:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2018-12-09 02:47:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2018-12-09 02:47:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 02:47:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-12-09 02:47:37,996 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-09 02:47:37,996 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-09 02:47:37,996 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 02:47:37,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-12-09 02:47:37,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-09 02:47:37,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:47:37,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:47:37,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:47:37,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-12-09 02:47:37,997 INFO L794 eck$LassoCheckResult]: Stem: 2596#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2588#L-1 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;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); 2589#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 2595#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2597#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 2607#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2602#L555 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; 2599#L557-3 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); 2604#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 2608#L557-4 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; 2592#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2593#L555 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; 2623#L557-3 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); 2613#L557-1 [2018-12-09 02:47:37,997 INFO L796 eck$LassoCheckResult]: Loop: 2613#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 2601#L557-3 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); 2612#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;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; 2611#L557-3 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); 2610#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 2590#L557-4 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; 2591#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 2594#L555 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; 2603#L557-3 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); 2613#L557-1 [2018-12-09 02:47:37,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1804472061, now seen corresponding path program 2 times [2018-12-09 02:47:37,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:37,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:37,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1547227717, now seen corresponding path program 3 times [2018-12-09 02:47:38,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:38,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:38,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:38,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1970848007, now seen corresponding path program 7 times [2018-12-09 02:47:38,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:47:38,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:47:38,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:38,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:47:38,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:47:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:47:38,585 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 140 [2018-12-09 02:47:38,723 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 02:47:38,726 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:47:38,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:47:38,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:47:38,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:47:38,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:47:38,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:47:38,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:47:38,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:47:38,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-09 02:47:38,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:47:38,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:47:38,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:38,926 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-12-09 02:47:39,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:47:39,268 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:47:39,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:47:39,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:39,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:39,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:39,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:39,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:39,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:39,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:39,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:39,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:39,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:39,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:39,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:39,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:39,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:39,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:39,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:39,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:39,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:39,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:47:39,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:47:39,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:47:39,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,277 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:47:39,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:47:39,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:39,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:47:39,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:47:39,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:47:39,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:47:39,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:47:39,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:47:39,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:47:39,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:47:39,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:47:39,293 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 02:47:39,293 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 02:47:39,293 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:47:39,294 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:47:39,294 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:47:39,294 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)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_7 Supporting invariants [] [2018-12-09 02:47:39,367 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 02:47:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 02:47:39,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:39,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:39,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:39,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:39,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:39,400 INFO L478 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-12-09 02:47:39,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:39,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:39,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:39,441 INFO L478 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-12-09 02:47:39,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:39,461 INFO L478 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-12-09 02:47:39,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:39,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:39,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-09 02:47:39,504 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:39,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 02:47:39,506 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:39,506 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-09 02:47:39,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-09 02:47:39,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 02:47:39,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-09 02:47:39,568 INFO L478 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 22 treesize of output 34 [2018-12-09 02:47:39,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:39,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:39,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:39,590 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-09 02:47:39,678 INFO L478 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-12-09 02:47:39,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-09 02:47:39,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,717 INFO L478 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-12-09 02:47:39,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:39,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-09 02:47:39,759 INFO L478 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 46 treesize of output 46 [2018-12-09 02:47:39,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:39,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:39,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:39,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-09 02:47:39,824 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 02:47:39,824 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:39,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:39,922 INFO L478 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-12-09 02:47:39,923 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:40,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 48 [2018-12-09 02:47:40,019 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,083 INFO L478 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-12-09 02:47:40,083 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,114 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,289 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-12-09 02:47:40,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,440 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-09 02:47:40,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 02:47:40,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-09 02:47:40,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-09 02:47:40,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,532 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:40,533 INFO L478 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 50 treesize of output 43 [2018-12-09 02:47:40,534 INFO L478 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 29 treesize of output 21 [2018-12-09 02:47:40,534 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:40,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-12-09 02:47:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:47:40,622 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-09 02:47:40,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-09 02:47:40,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 87 states and 107 transitions. Complement of second has 16 states. [2018-12-09 02:47:40,736 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-12-09 02:47:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-12-09 02:47:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-09 02:47:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:40,737 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:40,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:40,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:40,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:40,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:40,767 INFO L478 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-12-09 02:47:40,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:40,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:40,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:40,793 INFO L478 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-12-09 02:47:40,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,817 INFO L478 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-12-09 02:47:40,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-09 02:47:40,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-09 02:47:40,868 INFO L478 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-12-09 02:47:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-09 02:47:40,898 INFO L478 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 22 treesize of output 27 [2018-12-09 02:47:40,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,918 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:40,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 02:47:40,920 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:40,921 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-09 02:47:40,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:40,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:40,936 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-09 02:47:41,028 INFO L478 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-12-09 02:47:41,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-09 02:47:41,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:41,070 INFO L478 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-12-09 02:47:41,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:41,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:41,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-09 02:47:41,114 INFO L478 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 46 treesize of output 46 [2018-12-09 02:47:41,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:41,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:41,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:41,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-09 02:47:41,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-09 02:47:41,181 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:41,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:41,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:41,430 INFO L478 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-12-09 02:47:41,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:41,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:41,543 INFO L478 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-12-09 02:47:41,544 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:41,603 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:41,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:41,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:41,790 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:76, output treesize:115 [2018-12-09 02:47:42,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:42,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-09 02:47:42,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-09 02:47:42,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,090 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:42,091 INFO L478 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 50 treesize of output 43 [2018-12-09 02:47:42,093 INFO L478 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 29 treesize of output 21 [2018-12-09 02:47:42,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:42,143 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-09 02:47:42,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 02:47:42,146 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 02:47:42,181 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:178, output treesize:129 [2018-12-09 02:47:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:47:42,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-12-09 02:47:42,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-09 02:47:42,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 90 states and 110 transitions. Complement of second has 18 states. [2018-12-09 02:47:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-09 02:47:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-12-09 02:47:42,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-09 02:47:42,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:42,535 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:47:42,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:47:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:42,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:42,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 02:47:42,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:42,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:42,565 INFO L478 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-12-09 02:47:42,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-09 02:47:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:47:42,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:47:42,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-12-09 02:47:42,592 INFO L478 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-12-09 02:47:42,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,615 INFO L478 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-12-09 02:47:42,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 02:47:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:42,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:42,641 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:35, output treesize:54 [2018-12-09 02:47:42,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-12-09 02:47:42,667 INFO L478 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-12-09 02:47:42,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-09 02:47:42,701 INFO L478 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 22 treesize of output 27 [2018-12-09 02:47:42,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:42,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 02:47:42,731 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:42,731 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2018-12-09 02:47:42,731 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,736 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:42,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:42,751 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:51 [2018-12-09 02:47:42,923 INFO L478 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-12-09 02:47:42,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-12-09 02:47:42,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:43,073 INFO L478 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-12-09 02:47:43,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:43,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-09 02:47:43,233 INFO L478 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 46 treesize of output 46 [2018-12-09 02:47:43,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:43,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:47:43,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,482 INFO L478 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-12-09 02:47:43,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 83 [2018-12-09 02:47:43,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:43,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,753 INFO L478 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-12-09 02:47:43,753 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:43,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,821 INFO L478 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-12-09 02:47:43,821 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:43,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:43,928 INFO L478 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-12-09 02:47:43,928 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:44,035 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 02:47:44,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-12-09 02:47:44,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-09 02:47:44,127 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,237 INFO L478 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-12-09 02:47:44,238 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 02:47:44,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,274 INFO L478 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-12-09 02:47:44,274 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,295 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 02:47:44,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 02:47:44,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 02:47:44,380 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 1 variables, input treesize:76, output treesize:218 [2018-12-09 02:47:44,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,526 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2018-12-09 02:47:44,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,539 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 96 [2018-12-09 02:47:44,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 02:47:44,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,659 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:47:44,659 INFO L478 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 50 treesize of output 43 [2018-12-09 02:47:44,661 INFO L478 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 29 treesize of output 21 [2018-12-09 02:47:44,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,739 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2018-12-09 02:47:44,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 02:47:44,741 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,809 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-12-09 02:47:44,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,818 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 73 [2018-12-09 02:47:44,819 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 02:47:44,835 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:47:44,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-12-09 02:47:44,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-09 02:47:44,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,897 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:47:44,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-12-09 02:47:44,935 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 13 variables, input treesize:314, output treesize:257 [2018-12-09 02:47:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:47:44,995 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 7 loop predicates [2018-12-09 02:47:44,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-12-09 02:47:45,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 89 states and 112 transitions. Complement of second has 18 states. [2018-12-09 02:47:45,099 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-12-09 02:47:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:47:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-09 02:47:45,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-09 02:47:45,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:45,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 22 letters. Loop has 9 letters. [2018-12-09 02:47:45,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:45,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 13 letters. Loop has 18 letters. [2018-12-09 02:47:45,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:47:45,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 112 transitions. [2018-12-09 02:47:45,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 02:47:45,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-12-09 02:47:45,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 02:47:45,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 02:47:45,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 02:47:45,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:47:45,101 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:47:45,101 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:47:45,102 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:47:45,102 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 02:47:45,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 02:47:45,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 02:47:45,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 02:47:45,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 02:47:45 BoogieIcfgContainer [2018-12-09 02:47:45,106 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 02:47:45,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:47:45,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:47:45,106 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:47:45,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:47:10" (3/4) ... [2018-12-09 02:47:45,109 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 02:47:45,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:47:45,110 INFO L168 Benchmark]: Toolchain (without parser) took 35389.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,110 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:47:45,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,110 INFO L168 Benchmark]: Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:47:45,110 INFO L168 Benchmark]: RCFGBuilder took 174.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,111 INFO L168 Benchmark]: BuchiAutomizer took 34868.66 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.7 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,111 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 kB). Peak memory consumption was 15.3 kB. Max. memory is 11.5 GB. [2018-12-09 02:47:45,112 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 174.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34868.66 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 334.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.7 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 kB). Peak memory consumption was 15.3 kB. 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 - 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 9 terminating modules (2 trivial, 4 deterministic, 3 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[y_ref][y_ref] + 2 * unknown-#memory_int-unknown[r][r] + 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[r][r] 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 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] 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 34.8s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 9.8s. Construction of modules took 0.6s. Büchi inclusion checks took 24.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/10 HoareTripleCheckerStatistics: 132 SDtfs, 333 SDslu, 103 SDs, 0 SdLazy, 727 SolverSat, 123 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital3529 mio100 ax102 hnf100 lsp97 ukn21 mio100 lsp35 div100 bol100 ite100 ukn100 eq192 hnf87 smp99 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...